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
-
117536 Solvers
-
Back to basics 12 - Input Arguments
626 Solvers
-
Set the array elements whose value is 13 to 0
1458 Solvers
-
Getting the indices from a matrix
734 Solvers
-
There are 10 types of people in the world
1396 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!
