Problem 46099. Identify full reptend primes

• Created by ChrisR

×

Like (0)

Difficulty:

(49)

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

• Column Removal

  26168 Solvers

• Find the numeric mean of the prime numbers in a matrix.

  9006 Solvers

• Sum the elements in either diagonal of a square matrix

  213 Solvers

• Find a Pythagorean triple

  4726 Solvers

• Sum the real and imaginary parts of a complex number

  141 Solvers

More from this Author297

• Determine the minimum number of swaps to sort a vector

  4 Solvers

• List numbers such that every sum of consecutive positive integers ending in those numbers is composite

  7 Solvers

• Compute the Tetris sequence

  5 Solvers

• Solve an ODE: diffusion problem 1

  6 Solvers

• Minimize a quadratic function

  7 Solvers