![](https://img-blog.csdnimg.cn/ef5a52b910d741f18c99f4e042f851f6.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
欧拉计划
文章平均质量分 75
欧拉计划(projecteuler.net)是一系列有挑战性的数学与计算机编程题,要解开它们,需要的不止是数学知识,更需要借助计算机和编程技巧来完成解答。
攻城狮杰森
计算机硕士,阿里云专家博主,华为云云享专家,CSDN 内容合伙人,51CTO 博客专家。竭力成为一名 Full Stack Developer. 关注杰森,与你同行,共同进步!
展开
-
【欧拉计划第 14 题】 最长的考拉兹序列 Longest Collatz sequence
Problem 14 Longest Collatz sequenceThe following iterative sequence is defined for the set of positive integers:n→n2 (n is even),n→3n+1 ( n is odd)\large n\rightarrow \frac{n}{2}\ \left ( n\ is\ even \right ) ,n\righ原创 2022-05-01 09:19:38 · 135817 阅读 · 2 评论 -
【欧拉计划第 13 题】 大数之和 Large sum
Problem 13 Large sumWork out the first ten digits of the sum of the following one-hundred 505050-digit numbers.Data file see end问题 13 大数之和计算以下 100100100 个 505050 位数字和的前十位数数据文件见文末思路分析大家看到题目,首先不要被这一堆数字给吓到,觉得它很难,我们仔细阅读下题干,发现并不难,所用知识点都比较容易将这 100100原创 2022-04-21 14:27:41 · 19569 阅读 · 0 评论 -
【欧拉计划第 12 题】 高度可除的三角数 Highly divisible triangular number
Problem 12 Highly divisible triangular numberThe sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1+2+3+4+5+6+7=281 + 2 + 3 + 4 + 5 + 6 + 7 = 281+2+3+4+5+6+7=28. The first ten terms would be:1原创 2022-04-19 22:02:36 · 8899 阅读 · 4 评论 -
【欧拉计划第 11 题】 网格中的最大乘积 Largest product in a grid
Problem 11 Largest product in a gridIn the 20×2020×2020×20 grid below, four numbers along a diagonal line have been marked in red.The product of these numbers is 26×63×78×14=178869626 × 63 × 78 × 14 = 178869626×63×78×14=1788696.What is the greatest原创 2022-04-18 15:18:11 · 945 阅读 · 3 评论 -
【欧拉计划第 10 题】 质数之和 Summation of primes
Problem 10 Summation of primesThe sum of the primes below 101010 is2+3+5+7=17\large 2 + 3 + 5 + 7 = 172+3+5+7=17Find the sum of all the primes below two million.问题 10 质数之和101010 以下的质数之和为2+3+5+7=17\large 2 + 3 + 5 + 7 = 172+3+5+7=17求两百万以下的原创 2022-04-17 16:05:33 · 1101 阅读 · 6 评论 -
【欧拉计划第 9 题】特殊的毕达哥拉斯三元数 Special Pythagorean triplet
Problem 9 Special Pythagorean tripletA Pythagorean triplet is a set of three natural numbers, a<b<ca < b < ca<b<c, for which,a2+b2=c2\large a^2+b^2=c^2a2+b2=c2For example,32+42=9+16=25=52\large 3^2+4^2=9+16=25=5^232+42=9+16=25原创 2022-04-17 13:32:59 · 1144 阅读 · 5 评论 -
【欧拉计划第 8 题】序列中最大的乘积 Largest product in a series
Problem 8 Largest product in a seriesThe four adjacent digits in the 1000-digit number that have the greatest product are 9∗9∗8∗9=58329*9*8*9=58329∗9∗8∗9=5832.Find the thirteen adjacent digits in the 1000-digit number that have the greatest product.原创 2022-04-15 17:35:37 · 19722 阅读 · 2 评论 -
【欧拉计划第 7 题】第 10001 个素数 10001st prime
Problem 7 10001st primeBy 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?问题 7 第 10001 个素数通过列出前六个素数:2、3、5、7、11 和 13,我们可以看到第 6 个素数是 13。第10001个质数是多少?思路分析读完题目,发现题目还是原创 2022-04-13 16:54:46 · 19952 阅读 · 2 评论 -
【欧拉计划第 6 题】和的平方与平方的和差值 Sum square difference
Problem 6 Sum square differenceThe sum of the squares of the first ten natural numbers is:12+22+32+⋯+102=385\large 1^2+2^2+3^2+\cdots+10^2=38512+22+32+⋯+102=385The square of the sum of the first ten natural numbers is:(1+2+3+⋯+10)2=552=3025\larg原创 2022-04-12 11:17:55 · 19903 阅读 · 1 评论 -
【欧拉计划第 5 题】最小公倍数 Smallest multiple
Problem 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 divisible by all of the numbers from 1 to 20?问题 52520 是可以除以 1 到 10 的每个数字而没有任何余数的最小原创 2022-04-11 15:02:22 · 20031 阅读 · 3 评论 -
【欧拉计划第 4 题】最大回文数乘积 Largest palindrome product
Problem 4A 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.问题 4回文数的两种读法都是一样的。由两个 2 位数字的乘积构成的最原创 2022-04-08 15:00:00 · 1049 阅读 · 2 评论 -
【欧拉计划第 3 题】最大质因数 Largest prime factor
欧拉计划(Project Euler)第三题,Problem 3:Largest prime factor原创 2022-04-08 09:53:59 · 1360 阅读 · 3 评论 -
【欧拉计划第 2 题】 偶数斐波那契数 Even Fibonacci numbers
Problem 2Each 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原创 2022-04-05 14:23:16 · 592 阅读 · 2 评论 -
【欧拉计划第 1 题】3 或 5 的倍数 Multiples of 3 or 5
Problem 1If 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 multiples of 3 or 5 below 1000.原创 2022-04-05 03:30:00 · 721 阅读 · 0 评论