Problem 46099. Identify full reptend primes

• Created by ChrisR
• Appears in Prime Numbers I

×

Like (0)

Difficulty:

(10)

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 ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers13

Suggested Problems

• Tic Tac Toe FTW

  1795 Solvers

• Sum all integers from 1 to 2^n

  16035 Solvers

• Remove NaN ?

  1260 Solvers

• Finding peaks

  422 Solvers

• Perimeter

  149 Solvers

More from this Author297

• Compute a sum

  7 Solvers

• Count alternating permutations

  10 Solvers

• Construct a continued fraction for a square root

  12 Solvers

• Multiply binary numbers

  10 Solvers

• Integrate a power tower

  4 Solvers