일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 리만합
- 시뮬레이션
- 이항분포
- 오일러
- 블록코딩
- 수학탐구
- 정오각형
- 피타고라스 정리
- counting sunday
- 지오지브라
- 삼각함수의그래프
- 구분구적법
- 몬테카를로
- 작도
- 제곱근의뜻
- 재귀함수
- Geogebra
- 알지오매스
- python
- 프로젝트 오일러
- 프랙탈
- 파이썬
- java
- 확률실험
- 큰 수의 법칙
- project euler
- 상합
- 하합
- 큰수의법칙
- algeomath
- Today
- Total
목록python (11)
이경수 선생님의 수학실험실
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..
Problem 4(Largest palindrome product)A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.Find the largest palindrome made from the product of two 3-digit numbers. In Python:product=0; result=0; num=[] for i in range(100, 1000): for j in range(100, 1000): product=i*j num=str(product) if num==num[::-1]: if product>res..