Problem 46099. Identify full reptend primes

• Created by ChrisR
• Appears in Algorithm I

×

Like (0)

Difficulty:

(20)

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

ANNOUNCEMENT ×

Who Deserves Your Praise? Discover the New Contribution Widget!

We are excited to announce another update to our Discussions area: the...

Problem Recent Solvers13

Suggested Problems

• Select every other element of a vector

  33917 Solvers

• Pangrams!

  3891 Solvers

• Math with Roman Numerals

  87 Solvers

• Sum of diagonals elements of a matrix

  223 Solvers

• Self-similarity 1 - Every other term

  62 Solvers

More from this Author292

• List Honaker primes

  13 Solvers

• Express numbers as the sum of a prime, a square, and a cube

  6 Solvers

• Identify prime words

  16 Solvers

• Count collisions in an idealized block system

  6 Solvers

• Solve an ODE: Ekman spiral on a solid surface

  2 Solvers