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

• Created by ChrisR

×

Like (1)

Difficulty:

(37)

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

• Elapsed Time

  2969 Solvers

• Program an exclusive OR operation with logical operators

  726 Solvers

• Back to basics 6 - Column Vector

  1075 Solvers

• "Low : High - Low : High - Turn around " -- Create a subindices vector

  549 Solvers

• Binary

  209 Solvers

More from this Author292

• Compute a sum involving the zeta function

  4 Solvers

• Compute a determinant

  9 Solvers

• Solve an ODE: diffusion problem 2

  5 Solvers

• List the erauqs

  23 Solvers

• Solve an ODE: concentrations predicted by the cells-in-series model

  3 Solvers