일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 이항분포
- 확률실험
- 구분구적법
- 프로젝트 오일러
- 제곱근의뜻
- 하합
- 프랙탈
- 알지오매스
- python
- 작도
- 큰수의법칙
- Geogebra
- java
- 블록코딩
- 삼각함수의그래프
- 지오지브라
- 피타고라스 정리
- 정오각형
- 리만합
- 재귀함수
- counting sunday
- 몬테카를로
- 수학탐구
- 상합
- algeomath
- 파이썬
- 오일러
- project euler
- 큰 수의 법칙
- 시뮬레이션
- Today
- Total
목록Project Euler (51)
이경수 선생님의 수학실험실
Problem 27(Quadratic primes) Euler discovered the remarkable quadratic formula: $$n^2+n+41$$ It turns out that the formula will produce \( 40 \) primes for the consecutive integer values \( 0 \leq n \leq 39 \). However, when \( n=40, \ \ 40^{2}+40+41=40(40+1)+41 \) is divisible by \( 41 \), and certainly when \( n=41, \ \ 41^{2}+41+41 \) is clearly divisible by \( 41 \). The incredible formula \..
Problem 26(Reciprocal cycles) A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given: 1/2= 0.5 1/3= 0.(3) 1/4= 0.25 1/5= 0.2 1/6= 0.1(6) 1/7= 0.(142857) 1/8= 0.125 1/9= 0.(1) 1/10= 0.1 Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle. Find the value o..
Problem 25(1000-digit Fibonacci number) The Fibonacci sequence is defined by the recurrence relation: Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1. Hence the first 12 terms will be: F1 = 1 F2 = 1 F3 = 2 F4 = 3 F5 = 5 F6 = 8 F7 = 13 F8 = 21 F9 = 34 F10 = 55 F11 = 89 F12 = 144 The 12th term, F12, is the first term to contain three digits. What is the index of the first term in the Fibonacci sequence ..
Problem 24(Lexicographic permutations) A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are: 012 021 102 120 201 210 What is the millionth lexicographic permutation of the di..
Problem 23(Non-abundant sums) A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number. A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n. As 12 is the..
Problem 22(Names scores) Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score. For example, when the list is sorted into alphabetical order, COLIN, ..
Problem 21(Amicable numbers) Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers. For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are..
Problem 20 (Factorial digit sum) n! means_n_× (n− 1) × ... × 3 × 2 × 1 For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800, and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. Find the sum of the digits in the number 100! In Python: # Power digit sum import time startTime = time.time() def factorial(n): if n == 1: return 1 else: return n * factorial(n-1) strNum = str..