The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are permutations of one another.
There are no arithmetic sequences made up of three 1-, 2-, or 3-digit primes, exhibiting this property, but there is one other 4-digit increasing sequence.
What 12-digit number do you form by concatenating the three terms in this sequence?
The series, \(1^1 + 2^2 + 3^3 + ... + 10^10 = 10405071317\).
Find the last ten digits of the series, \(1^1 + 2^2 + 3^3 + 1000^1000\).
The first two consecutive numbers to have two distinct prime factors are:
\[14 = 2 × 7\] \[15 = 3 × 5\]The first three consecutive numbers to have three distinct prime factors are:
\[644 = 2^2 × 7 × 23\] \[645 = 3 × 5 × 43\] \[646 = 2 × 17 × 19\]Find the first four consecutive integers to have four distinct prime factors each. What is the first of these numbers?
至少我以前做过2波欧拉，当然也是各种搁置。
主要和以前的代码相比，就是修改了下格式，偶尔加上一两句吐槽。
这里是以前在sina blog上面贴过的解答，主要发现在公司居然不能上sina blog，而且上面的代码格式太不堪入目了，所以有空就整理下。
偶尔看看自己以前写的代码也很有意思，特别是一些C的代码
It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square.
\[9 = 7 + 2×1^2\] \[15 = 7 + 2×2^2\] \[21 = 3 + 2×3^2\] \[25 = 7 + 2×3^2\] \[27 = 19 + 2×2^2\] \[33 = 31 + 2×1^2\]It turns out that the conjecture was false.
What is the smallest odd composite that cannot be written as the sum of a prime and twice a square?
好久以前就开始玩欧拉刷题（>800天），但是显然我做题速度远远低于它出题速度
虽然我不觉得欧拉的好友有什么很大的用处，不过如果想加我好友的可以点
主要是鸡毛突然从我的好友名单里面消失了……
Triangle, pentagonal, and hexagonal numbers are generated by the following formulae:
Triangle Tn=n(n+1)/2 1, 3, 6, 10, 15, …
Pentagonal Pn=n(3n−1)/2 1, 5, 12, 22, 35, …
Hexagonal Hn=n(2n−1) 1, 6, 15, 28, 45, …
It can be verified that T285 = P165 = H143 = 40755.
Find the next triangle number that is also pentagonal and hexagonal.