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
-
14274 Solvers
-
Which values occur exactly three times?
5248 Solvers
-
Remove the small words from a list of words.
1566 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
520 Solvers
-
Create matrix of replicated elements
399 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
