Problem 51198. Find pairs of primes with the same digit sum and a specified separation

• Created by ChrisR
• Appears in Prime Numbers II

×

Like (1)

• Solve Later   
• Add To GroupÂ

Write a function that takes a number n as input and finds the first set of n primes such that the first and last have the same digit sum. For example, if the function is given , it should return [2 11] because those numbers begin and end the string of 5 primes—2, 3, 5, 7, 11.

See also Cody Problem 50933

Solve

Solution Stats

88.24% Correct | 11.76% Incorrect

• 17 Solutions
• 13 Solvers

Last Solution submitted on Sep 13, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers13

Suggested Problems

• The Goldbach Conjecture, Part 2

  2380 Solvers

• Cannon Ball

  307 Solvers

• Program an exclusive OR operation with logical operators

  729 Solvers

• System of equations

  351 Solvers

• Evened up (or not)

  157 Solvers

More from this Author298

• Solve an ODE: equation C

  5 Solvers

• Compute an integral of a product of sinusoids

  8 Solvers

• Evaluate the zeta function for complex arguments

  11 Solvers

• Generate the Figure-Figure sequence

  10 Solvers

• Iterate the sum of divisors and totient

  14 Solvers