Problem 46099. Identify full reptend primes

• Created by ChrisR
• Appears in Easy basics

×

Like (0)

Difficulty:

(1095)

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

• Fibonacci sequence

  13604 Solvers

• Find the palindrome

  1632 Solvers

• Add more zeros

  324 Solvers

• Given area find sides

  534 Solvers

• Triangle sequence

  5356 Solvers

More from this Author298

• Solve an ODE: equation C

  5 Solvers

• Label primes with the Erdos-Selfridge classification

  13 Solvers

• Design a well field in an infinite aquifer

  3 Solvers

• Compute the dispersion coefficient

  4 Solvers

• Solve an ODE: nonlinear third-order equation

  3 Solvers