Odd period square roots
Problem 64
All square roots are periodic when written as continued fractions and can be written in the form:
√N = a0 +
1
a1 +
1
...
分类：
编程语言 时间：
2015-02-01 16:14:25
阅读次数：
303
Number spiral diagonals
Problem 28
Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows:
21 22 23 24 25
20 7 8 9 10
19 6 1...
分类：
编程语言 时间：
2015-02-01 16:13:49
阅读次数：
232
Digit fifth powers
Problem 30
Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:
1634 = 14 + 64 + 34 + 44
8208 = 84 + 24 + 04 + 84
...
分类：
编程语言 时间：
2015-02-01 16:11:28
阅读次数：
209
Convergents of e
Problem 65
The square root of 2 can be written as an infinite continued fraction.
√2 = 1 +
1
2 +
1
2 +
1
2 +
1
...
分类：
编程语言 时间：
2015-01-31 16:27:32
阅读次数：
178
Maximum path sum II
Problem 67
By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.
3
7 4
2 4 6
8 5 9...
分类：
编程语言 时间：
2015-01-31 13:06:41
阅读次数：
185
Factorial digit sum
Problem 20
n! means n × (n ? 1) × ... × 3 × 2 × 1
For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,
and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + ...
分类：
编程语言 时间：
2015-01-31 13:00:55
阅读次数：
177
Amicable numbers
Problem 21
Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).
If d(a) = b and d(b) = a, where a ≠ b, then a and b are ...
分类：
编程语言 时间：
2015-01-31 12:14:43
阅读次数：
221
最近闲的做了下Project Euler 上的题目，前面50题都比较简单，简单总结下，一下代码一般是Python和C/C++的 用Python 做这些题目简直是酸爽啊
一下代码可能不一定是我的，因为不知道论坛里面的回复不是永久的，所以我的代码有的丢了，可能找个和我的意思相近的代码。题目翻译是从
欧拉计划 | Project Euler 中文翻译站上面Copy
的表告我。
Prob...
分类：
其他好文 时间：
2015-01-31 00:26:08
阅读次数：
241
Number letter counts
Problem 17
If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.
If all the numbers ...
分类：
编程语言 时间：
2015-01-29 14:44:35
阅读次数：
207
Maximum path sum I
Problem 18
By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.
3
7 4
2 4 6
8 5 9 ...
分类：
编程语言 时间：
2015-01-29 14:38:58
阅读次数：
330
