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 Solvers23
Suggested Problems
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2586 Solvers
-
The Answer to Life, the Universe, and Everything
588 Solvers
-
Chebyshev polynomials of the 2nd Kind
79 Solvers
-
Sum the numbers on the main diagonal
620 Solvers
-
Sum the real and imaginary parts of a complex number
145 Solvers
More from this Author329
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
