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
-
Remove all the words that end with "ain"
2700 Solvers
-
Back to basics 9 - Indexed References
463 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
589 Solvers
-
173 Solvers
-
160 Solvers
More from this Author324
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
