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.
Write a function that determines whether the input is a full reptend prime.
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers24
Suggested Problems
-
Back to basics 25 - Valid variable names
340 Solvers
-
Find out missing number from a vector of 9 elements
322 Solvers
-
229 Solvers
-
376 Solvers
-
Approximation of Pi (vector inputs)
285 Solvers
More from this Author330
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!