Problem 46099. Identify full reptend primes

• Created by ChrisR
• Appears in Date & Time II

×

Like (0)

Difficulty:

(1020)

Rate

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

20.31% Correct | 79.69% Incorrect

• 64 Solutions
• 13 Solvers

Last Solution submitted on Sep 08, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers13

Suggested Problems

• Clean the List of Names

  1751 Solvers

• Project Euler: Problem 2, Sum of even Fibonacci

  2497 Solvers

• Arrange Vector in descending order

  11823 Solvers

• Angle between two vectors

  774 Solvers

• CONVERT TAN TO SIN

  373 Solvers

More from this Author291

• Count estrangements

  7 Solvers

• Compute the water table elevation in an unconfined aquifer with recharge

  4 Solvers

• Compute home primes in a given base

  10 Solvers

• Count the square-full divisors of a number

  7 Solvers

• Inscribe a circle in a triangle with a side of length equal to the circle’s circumference

  6 Solvers