본문 바로가기

Python

 (9)
8. Largest product in a series projecteuler.net/problem=8 Problem 8 - Project Euler The page has been left unattended for too long and that link/button is no longer active. Please refresh the page. projecteuler.net 문제는 다음과 같습니다. 더보기 The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832. 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801..
7. 10001st prime projecteuler.net/problem=7 Problem 7 - Project Euler The page has been left unattended for too long and that link/button is no longer active. Please refresh the page. projecteuler.net 문제는 다음과 같습니다. 더보기 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? 10001번째 소수를 구하는 문제입니다. 소수를 구하는 방법은 여러가지 방법이 있습니다만, 저는 에라토스테네..
6. Sum square difference projecteuler.net/problem=6 Problem 6 - Project Euler The page has been left unattended for too long and that link/button is no longer active. Please refresh the page. projecteuler.net 문제는 다음과 같습니다. 더보기 The sum of the squares of the first ten natural numbers is, 12+22+...+102=385 The square of the sum of the first ten natural numbers is, (1+2+...+10)2=552=3025 Hence the difference between the sum..
5. Smallest multiple projecteuler.net/problem=5 Problem 5 - Project Euler The page has been left unattended for too long and that link/button is no longer active. Please refresh the page. projecteuler.net 문제는 다음과 같습니다. 더보기 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 ..
4. Largest palindrome product projecteuler.net/problem=4 Problem 4 - Project Euler The page has been left unattended for too long and that link/button is no longer active. Please refresh the page. projecteuler.net 문제는 다음과 같습니다. 더보기 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-dig..
3. Largest prime factor projecteuler.net/problem=3 Problem 3 - Project Euler The page has been left unattended for too long and that link/button is no longer active. Please refresh the page. projecteuler.net 문제는 다음과 같습니다. 더보기 The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? 주어진 숫자의 약수 중 소수를 찾고, 찾은 소수 중 가장 큰 값을 구하라는 문제입니다. 이번 문제 또한, 다른 알고리즘 전략을 이용할 필요까지는 없어보여서..
2. Even Fibonacci numbers https://projecteuler.net/problem=2 Problem 2 - Project Euler 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 excee projecteuler.net 문제는 다음과 같습니다. 더보기 Each new term in the Fibonacci sequence is ge..
0. Project Euler란 무엇이고, 문제를 풀기 시작한 이유...? https://projecteuler.net/about About - Project Euler About Project Euler What is Project Euler? Project Euler is a series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve. Although mathematics will help you arrive at elegant and efficie projecteuler.net 대학시절 교수님께서 추천해 주셨던 알고리즘 사이트입니다. 그 당시에는 얼마 풀지 않았었지만, 회사의 성과급과 파이썬 공부를 위해..

티스토리툴바