일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 수학탐구
- 오일러
- java
- 정오각형
- 알지오매스
- 삼각함수의그래프
- 몬테카를로
- 피타고라스 정리
- 작도
- project euler
- 파이썬
- 큰 수의 법칙
- 재귀함수
- 프랙탈
- 프로젝트 오일러
- 리만합
- python
- 큰수의법칙
- 제곱근의뜻
- 하합
- Geogebra
- 블록코딩
- 지오지브라
- 이항분포
- counting sunday
- 확률실험
- 시뮬레이션
- algeomath
- 상합
- 구분구적법
- Today
- Total
목록project euler (12)
이경수 선생님의 수학실험실
Problem 8(Largest product in a series)The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832. 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 6689664895044524452316173185640309871112172238311..
Problem 7(10001st prime)By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.What is the 10 001st prime number? In Python:# PE7 10001st prime import time import math startTime = time.time() order = 1 num = 1 def is_prime(n): if n == 1: return False elif n == 2: return True else: i = 2 while i < math.ceil(math.sqrt(n)) + 1: if n % i == 0: return Fals..
Problem 6(Sum square difference)The sum of the squares of the first ten natural numbers is,12 + 22 + ... + 102 = 385The square of the sum of the first ten natural numbers is,(1 + 2 + ... + 10)2 = 552 = 3025Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.Find the difference between the sum of the squares of the fi..
Problem 5(Smallest multiple)2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20? In Python:import time startTime = time.time() multiple = 1 temp = 0 for i in range(2, 21): for j in range(2, i+1): temp = multiple while i % j == 0: i = i / j if temp..