• 10推荐

000. 欧拉计划简介

欧拉计划是什么？ 欧拉计划（Project Euler）是一个具有挑战性的不仅仅需要具备数学能力的“数学/计算机编程”问题集合。数学方面的知识可以帮助你获得优雅而高效的解决方案，与此同时，计算机应用和编程技巧也不可或缺。 开展欧拉计划这个项目并且持续进行下去的主要目的是提供…...

• 9推荐

473. 斐基数

题目 [Problem 473: Phigital number base][1] Let φ be the golden ratio: φ ![][2]. Remarkably it is possible to write every positive intege…...

• 9推荐

008. 序列中的最大乘积

题目 Problem 008: Largest product in a series The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 ×…...

• 8推荐

192. 最佳逼近

题目 Problem 192: Best Approximations Let x be a real number. A best approximation to x for the denominator bound d is a rational number …...

• 7推荐

119. 数字之和的幂

题目 Problem 119: Digit power sum The number 512 is interesting because it is equal to the sum of its digits raised to some power: 5 + 1 +…...

• 7推荐

183. 整数平分后的最大乘积

题目 Problem 183: Maximum product of parts Let N be a positive integer and let N be split into k equal parts, r = N/k, so that N = r + r +…...

• 7推荐

009. 特定的直角三角形

题目 Problem 9: Speical Pythagorean triplet A Pythagorean triplet is a set of three natural numbers, a &lt; b &lt; c, for which, &nbsp; &…...

• 7推荐

002. 斐波那契数列中的偶数

题目 Problem 2: Even Fibonacci numbers Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting …...

• 7推荐

549. 阶乘的整除性

题目 Problem 549. Divisibility of factorials The smallest number m such that 10 divides m! is m=5. The smallest number m such that 25 divi…...

• 7推荐

581. 47-光滑三角形数

题目 Problem 581. 47-smooth triangular numbers A number is p-smooth if it has no prime factors larger than p. Let T be the sequence of tri…...

• 7推荐

266. 伪平方根

题目 Problem 266. Pseudo Square Root The divisors of 12 are: 1,2,3,4,6 and 12. The largest divisor of 12 that does not exceed the square r…...

• 7推荐

100. 安排的概率

题目 Problem 100. Arranged probability If a box contains twenty-one coloured discs, composed of fifteen blue discs and six red discs, and …...

• 7推荐

587. 凹三角形

题目 Problem 587. Concave triangle A square is drawn around a circle as shown in the diagram below on the left. We shall call the blue sha…...

• 6推荐

593. 中位数

题目 Problem 593. Fleeting Medians We define two sequences ![][1] and ![][2]: ![][3] where pk is the kth prime number. … ...

• 6推荐

386. 反链的最大长度

题目 Problem 386: Maximum length of an antichain Let n be an integer and S(n) be the set of factors of n. A subset A of S(n) is called an…...

• 6推荐

487. 幂和之和

题目 [Problem 487: Sums of power sums][1] Let fk(n) be the sum of the kth powers of the first n positive integers. For example, f2(10) = …...

• 6推荐

578. 素数的降幂构成的整数

题目 Prolblem 578: Integers with decreasing prime powers Any positive integer can be written as a product of prime powers: p1a1 ...

• 6推荐

004. 回文数

题目 Problem 4: Largest palindrome product A palindromic number reads the same both ways. The largest palindrome made from the product of …...

• 6推荐

174. 空心薄板分类计数

题目 Problem 174: Counting the number of &quot;hollow&quot; square laminae that can form one, two, three, ... distinct arrangements We sha…...

• 6推荐

479. 方程的根

题目 Problem 479: Roots on the Rise Let ak, bk, and ck represent the three solutions (real or complex numbers) to the e… ...