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
-
Return a list sorted by number of occurrences
2901 Solvers
-
Count from 0 to N^M in base N.
241 Solvers
-
398 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
698 Solvers
-
Circular Primes (based on Project Euler, problem 35)
658 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!
