Cody Problem 273, which is based on Project Euler Problem 26, introduced me to full reptend primes. If p is a full reptend prime, then 
has a period of 
. That is, the decimal expansion of has strings of digits that repeat. The first five full reptend primes are 7, 17, 19, 23, and 29.
has a period of . That is, the decimal expansion of has strings of digits that repeat. The first five full reptend primes are 7, 17, 19, 23, and 29. Write a function that determines whether the input is a full reptend prime.
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers21
Suggested Problems
-
285 Solvers
-
10719 Solvers
-
519 Solvers
-
Rosenbrock's Banana Function and its derivatives
166 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
414 Solvers
More from this Author323
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
