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 Solvers12
Suggested Problems
-
Arrange Vector in descending order
10517 Solvers
-
867 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
595 Solvers
-
Replace all zeros and NaNs in a matrix with the string 'error'
97 Solvers
-
Detect a number and replace with two NaN's
190 Solvers
More from this Author249
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!