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

• Created by ChrisR

×

Like (1)

Difficulty:

(55)

Rate

• 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

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

• Scrabble Scores

  2099 Solvers

• Remove the polynomials that have positive real elements of their roots.

  1705 Solvers

• Is the Point in a Circle?

  616 Solvers

• I've got the power! (Inspired by Project Euler problem 29)

  129 Solvers

• Sums of cubes and squares of sums

  267 Solvers

More from this Author292

• Count the peaceful queens

  64 Solvers

• List the dihedral primes

  12 Solvers

• List composite numbers that cannot be written as the sum of two primes

  11 Solvers

• Classify water surface profiles

  4 Solvers

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

  7 Solvers