일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 구분구적법
- algeomath
- counting sunday
- 몬테카를로
- 큰수의법칙
- 큰 수의 법칙
- 지오지브라
- 오일러
- java
- 블록코딩
- 파이썬
- 알지오매스
- 삼각함수의그래프
- python
- 하합
- 제곱근의뜻
- 상합
- Geogebra
- 확률실험
- 이항분포
- project euler
- 정오각형
- 시뮬레이션
- 피타고라스 정리
- 리만합
- 작도
- 수학탐구
- 프랙탈
- 재귀함수
- 프로젝트 오일러
- Today
- Total
이경수 선생님의 수학실험실
Problem 39(Integer right triangles) If p is the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions for p = 120. {20,48,52}, {24,45,51}, {30,40,50} For which value of p ≤ 1000, is the number of solutions maximised? In Python: import time def ispythatriple(p, i, j): if i ** 2 + j ** 2 == (p - (i + j)) ** 2: return True else: return False star..
Problem 38(Pandigital multiples) Take the number 192 and multiply it by each of 1, 2, and 3: 192 × 1 = 192 192 × 2 = 384 192 × 3 = 576 By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1,2,3) The same can be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital, 918273645, which is ..
Problem 37(Truncatable primes) The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3. Find the sum of the only eleven primes that are both truncatable from left to right and right to left. NOTE: 2, 3, 5, a..
Problem 36(Double-base palindromes) The decimal number, \(585 = 1001001001_{2}\) (binary), is palindromic in both bases. Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2. (Please note that the palindromic number, in either base, may not include leading zeros.) In Python: import math import time def ispalindrome10(n): dig = int(math.log10(n)) + 1 nSt..
Problem 35(Circular primes) The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime. There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97. How many circular primes are there below one million? In Python: import time import math startTime = time.time() def circular(n): nStr = str(n) return int..
Problem 34(Digit factorials) 145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145. Find the sum of all numbers which are equal to the sum of the factorial of their digits. Note: as 1! = 1 and 2! = 2 are not sums they are not included. In Python: import time import math startTime = time.time() result = 0 for n in range(3, 10 ** 7): nList = list(str(n)) sumFact = 0 for num in nList: sumFa..
Problem 33(Digit cancelling fractions) The fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that 49/98 = 4/8, which is correct, is obtained by cancelling the 9s. We shall consider fractions like, 30/50 = 3/5, to be trivial examples. There are exactly four non-trivial examples of this type of fraction, less than one in va..
Problem 32(Pandigital products) We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital. The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital. Find the sum of all products whose multiplicand/multipl..