ProjectEular
文章平均质量分 62
hackingwu
pseudo-geek!developer!learner!
展开
-
001. 3和5的倍数
Problem 1: Multiples of 3 and 5If 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 multip原创 2014-05-21 17:08:09 · 890 阅读 · 0 评论 -
欧拉计划(ProjectEuler008):相邻13个数乘积最大
Largest product in a seriesProblem 8The four adjacent digits in the 1000-digit number that have the greatest product are 9 9 8 9 = 5832.731671765313306249192251196744265747423553491原创 2014-05-23 17:16:45 · 1179 阅读 · 0 评论 -
欧拉项目010:2000000以内的素数和
Summation of primesProblem 10The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.Find the sum of all the primes below two million.还是使用Sieve of Eratosthenes 算法我的python代码如下:原创 2014-05-23 10:29:46 · 1187 阅读 · 0 评论 -
006:欧拉项目平方和与和的平方的差
Sum square differenceProblem 6The 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 + .原创 2014-05-22 12:57:37 · 708 阅读 · 0 评论 -
欧拉项目005:最小公倍数
Smallest multipleProblem 52520 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 di原创 2014-05-22 10:59:25 · 828 阅读 · 0 评论 -
欧拉项目007:第10001个素数
10001st primeProblem 7By 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?使用埃拉托斯特尼筛法,不懂得自行Wiki我的py原创 2014-05-22 16:33:14 · 1257 阅读 · 0 评论 -
欧拉项目004:寻找最大的回文数
Problem 4: Largest palindrome productA 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 pal原创 2014-05-21 19:40:45 · 1310 阅读 · 0 评论 -
欧拉计划003. 最大素因子
Problem 3: Largest prime factorThe prime factors of 13195 are 5, 7, 13 and 29.What is the largest prime factor of the number 600851475143 ?求出最大素因子我的python代码如下:又不懂的,或者更好的可以留言,大家互相原创 2014-05-21 17:11:43 · 805 阅读 · 0 评论 -
欧拉计划是什么?
以下文字来自欧拉计划是什么?欧拉计划(Project Euler)是一个具有挑战性的不仅仅需要具备数学能力的“数学/计算机编程”问题集合。数学方面的知识可以帮助你获得优雅而高效的解决方案,与此同时,计算机应用和编程技巧也不可或缺。开展欧拉计划这个项目并且持续进行下去的主要目的是提供一个有趣味并且有创造性的环境,在这里可以探索未知领域、学习新的概念。这些问题适合那些人转载 2014-05-21 17:06:13 · 1504 阅读 · 0 评论 -
002. 斐波那契数列中的偶数
Problem 2: Even Fibonacci numbersEach 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,原创 2014-05-21 17:09:56 · 1040 阅读 · 0 评论 -
欧拉计划013(ProjectEuler013):求出10个数乘积最大的
申明:之前的所有欧拉计划都是用python来原创 2014-05-25 14:22:45 · 887 阅读 · 0 评论