일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
Tags
- 몬테카를로
- 프로젝트 오일러
- 작도
- 시뮬레이션
- 제곱근의뜻
- python
- project euler
- 재귀함수
- 큰 수의 법칙
- 알지오매스
- 블록코딩
- 확률실험
- 구분구적법
- 프랙탈
- 삼각함수의그래프
- 수학탐구
- counting sunday
- 지오지브라
- Geogebra
- java
- 하합
- 큰수의법칙
- 상합
- 오일러
- 피타고라스 정리
- 이항분포
- 파이썬
- algeomath
- 정오각형
- 리만합
Archives
- Today
- Total
이경수 선생님의 수학실험실
Problem 51(Prime digit replacements) 본문
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 |
Comments