Problem 46099. Identify full reptend primes
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 commentsProblem Recent Solvers11
Suggested Problems
-
Determine whether a vector is monotonically increasing
18578 Solvers
-
Swap the first and last columns
18575 Solvers
-
1208 Solvers
-
Least common multiple of many numbers
225 Solvers
-
637 Solvers
More from this Author230
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!