码迷,mamicode.com
首页 >  
搜索关键字:euler    ( 502个结果
Project Euler:Problem 47 Distinct primes factors
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² × 7 × 23 ...
分类:其他好文   时间:2015-06-07 11:08:41    阅读次数:106
Project Euler:Problem 42 Coded triangle numbers
The nth term of the sequence of triangle numbers is given by, tn = ½n(n+1); so the first ten triangle numbers are: 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ... By converting each letter in a word to a...
分类:其他好文   时间:2015-06-05 12:29:01    阅读次数:128
Project Euler:Problem 41 Pandigital prime
We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime. What is the largest n-digit pandi...
分类:其他好文   时间:2015-06-05 10:11:25    阅读次数:111
Project Euler:Problem 38 Pandigital multiples
Take the number 192 and multiply it by each of 1, 2, and 3: 192 × 1 = 192 192 × 2 = 384 192 × 3 = 576 By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 19238457...
分类:其他好文   时间:2015-06-04 13:56:53    阅读次数:127
Project Euler:Problem 40 Champernowne's constant
An irrational decimal fraction is created by concatenating the positive integers: 0.123456789101112131415161718192021... It can be seen that the 12th digit of the fractional part is 1. If dn repr...
分类:其他好文   时间:2015-06-04 13:55:04    阅读次数:118
Project Euler:Problem 36 Double-base palindromes
The decimal number, 585 = 10010010012 (binary), is palindromic in both bases. Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2. (Please note that the...
分类:其他好文   时间:2015-06-04 12:00:19    阅读次数:109
Project Euler:Problem 37 Truncatable primes
The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we c...
分类:其他好文   时间:2015-06-04 11:56:43    阅读次数:84
Project Euler:Problem 39 Integer right triangles
If p is the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions for p = 120. {20,48,52}, {24,45,51}, {30,40,50} For which value of p ≤ 1000, is...
分类:其他好文   时间:2015-06-04 11:47:49    阅读次数:107
Project Euler:Problem 34 Digit factorials
145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145. Find the sum of all numbers which are equal to the sum of the factorial of their digits. Note: as 1! = 1 and 2! = 2 are not sums they...
分类:其他好文   时间:2015-06-03 15:53:03    阅读次数:112
Project Euler:Problem 31 Coin sums
In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation: 1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p). It is possible to make £2 in the...
分类:其他好文   时间:2015-06-03 12:00:39    阅读次数:114
502条   上一页 1 ... 35 36 37 38 39 ... 51 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!