码迷,mamicode.com
首页 >  
搜索关键字:project-euler    ( 184个结果
Project Euler:Problem 74 Digit factorial chains
The number 145 is well known for the property that the sum of the factorial of its digits is equal to 145: 1! + 4! + 5! = 1 + 24 + 120 = 145 Perhaps less well known is 169, in that it produces the...
分类:其他好文   时间:2015-07-17 22:49:49    阅读次数:132
Project Euler:Problem 71 Ordered fractions
Consider the fraction, n/d, where n and d are positive integers. If nd and HCF(n,d)=1, it is called a reduced proper fraction. If we list the set of reduced proper fractions for d ≤ 8 in ascending or...
分类:其他好文   时间:2015-07-17 16:26:05    阅读次数:130
Project Euler:Problem 72 Counting fractions
Consider the fraction, n/d, where n and d are positive integers. If nd and HCF(n,d)=1, it is called a reduced proper fraction. If we list the set of reduced proper fractions for d ≤ 8 in ascending or...
分类:其他好文   时间:2015-07-17 16:24:15    阅读次数:121
Project Euler:Problem 70 Totient permutation
Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of positive numbers less than or equal to n which are relatively prime to n. For example, as 1, 2,...
分类:其他好文   时间:2015-07-17 14:04:42    阅读次数:142
Project Euler:Problem 68 Magic 5-gon ring
Consider the following "magic" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine. Working clockwise, and starting from the group of three with the numerically lowest exte...
分类:其他好文   时间:2015-07-17 10:06:11    阅读次数:231
Project Euler:Problem 69 Totient maximum
Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of numbers less than n which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are ...
分类:其他好文   时间:2015-07-17 10:05:11    阅读次数:174
Project Euler:Problem 67 Maximum path sum II
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 3 That is, 3 + 7 + 4 + 9 = 23. Find th...
分类:其他好文   时间:2015-07-16 09:52:17    阅读次数:155
Project Euler:Problem 61 Cyclical figurate numbers
Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae: Triangle   P3,n=n(n+1)/2   1, 3,...
分类:其他好文   时间:2015-07-14 18:23:07    阅读次数:83
Project Euler:Problem 62 Cubic permutations
The cube, 41063625 (3453), can be permuted to produce two other cubes: 56623104 (3843) and 66430125 (4053). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits ...
分类:其他好文   时间:2015-07-14 18:21:53    阅读次数:113
Project Euler:Problem 63 Powerful digit counts
The 5-digit number, 16807=75, is also a fifth power. Similarly, the 9-digit number, 134217728=89, is a ninth power. How many n-digit positive integers exist which are also an nth power? 这样的数字满...
分类:其他好文   时间:2015-07-14 17:58:13    阅读次数:195
184条   上一页 1 ... 11 12 13 14 15 ... 19 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!