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
-
7310 Solvers
-
Remove any row in which a NaN appears
8278 Solvers
-
216 Solvers
-
332 Solvers
-
Pernicious Anniversary Problem
797 Solvers
More from this Author231
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!