### EularProject

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

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

2017-02-23 22:47
224
• #### EularProject 87：Prime power triples

The smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is ...

2018-05-20 20:53
71
• #### EularProject 85：Counting rectangles

Andrew Zhang Nov 4, 2017By counting carefully it can be seen that a rectangular grid measuring 3 b...

2017-11-04 23:38
115
• #### 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
400
• #### EularProject 74：Digit factorial chains

Andrew zhang Sep 4, 2017The number 145 is well known for the property that the sum of the factorial...

2017-09-04 23:21
187
• #### EularProject 73：Counting fractions in a range

Andrew Zhang Nov 11, 2017Consider the fraction, n/d, where n and d are positive integers. If n < d...

2017-11-11 19:34
136
• #### 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
477
• #### EularProject 70：Totient permutation

Euler’s Totient function, φ(n) [sometimes called the phi function], is used to determine the number ...

2018-05-21 21:59
93
• #### EularProject 66：Diophantine equation

Andrew Zhang Nov 4, 2017Consider quadratic Diophantine equations of the form:x2–Dy2=1x^2 – Dy^2 = ...

2017-11-04 23:31
110
• #### EularProject 61：Cyclical figurate numbers

Andrew Zhang Sep 4, 2017Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers...

2017-10-17 21:22
212
• #### EularProject 67: 三角形数字矩阵的最大路径

Maximum path sum II Problem 67 By starting at the top of the triangle below and moving to adjace...

2015-01-30 22:23
1068
• #### 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
611
• #### 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
1435
• #### 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
1551
• #### EularProject 39：给周长判断构成直角三角形个数

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

2015-07-30 12:20
1501
• #### 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
1711
• #### EularProject 37：双向可截素数

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

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

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

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

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

2015-07-28 09:59
1364
• #### 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
2744

6421737

1436367

42136816

4869979