일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- Geogebra
- algeomath
- 확률실험
- java
- 오일러
- 리만합
- 시뮬레이션
- 하합
- 몬테카를로
- 큰 수의 법칙
- 정오각형
- 프랙탈
- 삼각함수의그래프
- 피타고라스 정리
- 구분구적법
- 큰수의법칙
- project euler
- 상합
- 제곱근의뜻
- counting sunday
- 블록코딩
- 재귀함수
- 지오지브라
- 프로젝트 오일러
- 알지오매스
- 파이썬
- 이항분포
- 작도
- python
- 수학탐구
- Today
- Total
목록Project Euler (51)
이경수 선생님의 수학실험실
Problem 3(Largest prime factor)The prime factors of 13195 are 5, 7, 13 and 29.What is the largest prime factor of the number 600851475143 ? In Python:import time start_time = time.time() num = 600851475143 i = 2 while i < (num / 2) + 1: while num % i == 0: num = num / i if num == 1: num = i break i += 1 print(int(num)) print(time.time() - start_time, "Seconds"Run time: 0.0020999908447265625 Seco..
Problem 2(Even Fibonacci numbers)Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. In Python:i=1 limit=4000000 sum=0 def fibonacci(n): if n..
Problem 1(Multiples of 3 and 5) If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000. In Python: sum=0 for i in range(1,1000): if i%3==0 or i%5==0: sum+=i print(sum) Run time: 0.00024700164794921875 seconds In Python:print(sum([i for i in range(1, 1000) if i % 3 == ..