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 1/p has a period of p-1. That is, the decimal expansion of 1/p has strings of p-1 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.
Solve

Solution Stats

100 Solutions

24 Solvers

Last Solution submitted on Oct 23, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers24

GeeTwo Tumo Tiantian Towel

Suggested Problems

More from this Author329

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!