### EularProject

0 已关注
31篇博文
• #### [EularProject]#Problem 99：Largest exponential

华电北风吹 2017-02-23Largest exponential Problem 99 Comparing two numbers written in index form like ...

2017-02-23 22:47
188
• #### Eularproject 76：Counting summations

Andrew Zhang Jul 16, 2017It is possible to write five as a sum in exactly six different ways:4 + 1 ...

2017-07-16 01:02
361
• #### EularProject 71：Ordered fractions

lazy_piger 2017-07-16Consider the fraction, n/d, where n and d are positive integers. If n<<d and H...

2017-07-16 14:42
430
• #### EularProject 44：和与差均是五角数中差最小值

Pentagon numbers Problem 44 Pentagonal numbers are generated by the formula, Pn=n(3n−1)/2. The fir...

2015-08-25 11:54
573
• #### EularProject 47：具有相同个数因子的连续数字

Distinct primes factors Problem 47 The first two consecutive numbers to have two distinct prime fa...

2015-08-15 20:20
609
• #### EularProject 42：单词解码出来的三角形数

Coded triangle numbers Problem 42 The nth term of the sequence of triangle numbers is given by, tn...

2015-07-30 16:05
1404
• #### EularProject 41：最长的n位Pandigital素数问题

Pandigital prime Problem 41 We shall say that an n-digit number is pandigital if it makes use of a...

2015-07-30 15:37
1504
• #### EularProject 39：给周长判断构成直角三角形个数

华电北风吹 天津大学认知计算与应用重点实验室 完成日期：2015/7/30Integer right triangles Problem 39 If p is the perimeter of...

2015-07-30 12:20
1465
• #### EularProject 38：数字组合1-9分解为数字与1到n的乘积的和

Pandigital multiples Problem 38 Take the number 192 and multiply it by each of 1, 2, and 3:192 × 1...

2015-07-30 11:34
1611
• #### EularProject 37：双向可截素数

Truncatable primes Problem 37 The number 3797 has an interesting property. Being prime itself, it ...

2015-07-30 10:59
1337
• #### EularProject 36：2进制和10进制回文数

华电北风吹 天津大学认知计算与应用重点实验室 完成日期：2015/7/29Double-base palindromes Problem 36 The decimal number, 585 ...

2015-07-29 23:07
1461
• #### EularProject 35：循环素数

Circular primes Problem 35 The number, 197, is called a circular prime because all rotations of th...

2015-07-28 09:59
1322
• #### EularProject 32: 数字1-9排列构成乘法等式

Pandigital products Problem 32 We shall say that an n-digit number is pandigital if it makes use o...

2015-07-25 22:23
2626
• #### EularProject 43: 带条件约束的排列组合挑选问题

Sub-string divisibility Problem 43 The number, 1406357289, is a 0 to 9 pandigital number because i...

2015-07-25 17:26
1575
• #### EularProject 48: 利用数组求和

Self powers Problem 48 The series, 11+22+33+...+1010=104050713171^1 + 2^2 + 3^3 + ... + 10^{10} = ...

2015-07-24 00:34
1933
• #### EularProject 40: 计算正整数连接构成无理数的确定位

Champernowne’s constant Problem 40 An irrational decimal fraction is created by concatenating the ...

2015-07-18 01:32
1672
• #### EularProject 7: 计算10001个素数

10001st prime Problem 7 By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can s...

2015-01-26 21:56
673
• #### EularProject 12: 三角形数的因子个数问题

Highly divisible triangular number Problem 12 The sequence of triangle numbers is generated by a...

2015-01-26 23:03
1422
• #### EularProject 15: 方格迷宫的路径数

Lattice paths Problem 15 Starting in the top left corner of a 2×2 grid, and only being able ...

2015-01-27 11:58
1181
• #### EularProject 18: 三角形矩阵的最大路径

Maximum path sum I Problem 18 By starting at the top of the triangle below and moving to adjacen...

2015-01-29 13:57
1261

6419875

1433350

40115330

4859877