이경수 선생님의 수학실험실

Problem 51(Prime digit replacements) 본문

Project Euler

Problem 51(Prime digit replacements)

(이경수) 2019. 8. 18. 19:27

Problem 51(Prime digit replacements)

By replacing the 1st digit of the 2-digit number *3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime.

By replacing the 3rd and 4th digits of 56**3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated numbers, yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993. Consequently 56003, being the first member of this family, is the smallest prime with this property.

Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an eight prime value family.

저작자표시 비영리 변경금지 (새창열림)

'Project Euler' 카테고리의 다른 글

Problem 50(Consecutive prime sum)  (0) 2019.08.18
Problem 49(Prime permutations)  (0) 2019.08.16
Problem 48(Self powers)  (0) 2019.08.16
Problem 47(Distinct primes factors)  (0) 2019.08.15
Problem 46(Goldbach's other conjecture)  (0) 2019.08.15
'Project Euler' Related Articles more
Comments