Pages

▼
Showing posts with label Euler Project. Show all posts
Showing posts with label Euler Project. Show all posts
Wednesday, October 22, 2014

Square root digital expansion : Problem 80 : Project Euler : Pyhton Code

›
Square root digital expansion : Problem 80 : Project Euler It is well known that if the square root of a natural number is not an in...

Largest exponential : Problem 99 : Project Euler

›
Largest exponential : Problem 99 : Project Euler Comparing two numbers written in index form like 2 11 and 3 7 is not difficult, as a...

Reciprocal cycles : Problem 26 : Project Euler : Python Code

›
Reciprocal cycles : Problem 26 : Project Euler A unit fraction contains 1 in the numerator. The decimal representation of the unit fra...
Tuesday, October 21, 2014

Non-abundant sums : Problem 23 : Project Euler : Python Code

›
Non-abundant sums : Problem 23 : Project Euler A perfect number is a number for which the sum of its proper divisors is exactly equal ...
Sunday, October 19, 2014

Permuted multiples :Problem 52 : Project Euler : Python Code

›
Permuted multiples :Problem 52 : Project Euler It can be seen that the number, 125874, and its double, 251748, contain exactly the sa...

Pandigital products : Problem 32 : Project Euler : Python Code

›
Pandigital products : Problem 32 : Project Euler We shall say that an n -digit number is pandigital if it makes use of all the digits 1 ...
Saturday, October 18, 2014

Pandigital prime : Problem 41 : Project Euler : Python Code

›
Pandigital prime : Problem 41 : Project Euler We shall say that an n -digit number is pandigital if it makes use of all the digits 1 to...

Coded triangle numbers : Problem 42 : Project Euler : JAVA Code

›
Coded triangle numbers : Problem 42 : Project Euler The n th term of the sequence of triangle numbers is given by, t n = ½ n ( n +1); ...
Friday, October 17, 2014

Digit factorial chains : Problem 74 : Project Euler Python Code

›
Digit factorial chains : Problem 74 : Project Euler Python Code The number 145 is well known for the property that the sum of the fact...

Bouncy numbers : Problem 112 : Project Euler : Python Code

›
Bouncy numbers : Problem 112 : Project Euler Working from left-to-right if no digit is exceeded by the digit to its left it is called a...
Thursday, October 16, 2014

Names scores : Problem 22 : Project Euler JAVA Code

›
Names scores : Problem 22 : Project Euler Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containin...

Square digit chains : Problem 92 : Project Euler

›
Square digit chains : Problem 92 : Project Euler A number chain is created by continuously adding the square of the digits in a number ...

Digit fifth powers :Problem 30 : Project Euler

›
Digit fifth powers :Problem 30 : Project Euler Surprisingly there are only three numbers that can be written as the sum of fourth power...

Digit factorials : Problem 34 : Project Euler

›
Digit factorials : Problem 34 Project Euler 145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145. Find the sum of all number...

Distinct powers : Problem 29 : Project Euler : Python Code

›
Distinct powers : Problem 29 : Project Euler Consider all integer combinations of a b for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5: 2 2 =4, 2 3 =8, ...

Number letter counts : Problem 17 : JAVA CODE

›
Number letter counts : Problem 17 : Project Euler   If the numbers 1 to 5 are written out in words: one, two, three, four, five, th...
Wednesday, October 15, 2014

Goldbach's other conjecture : Problem 46 Pyhton Code

›
Goldbach's other conjecture : Problem 46 It was proposed by Christian Goldbach that every odd composite number can be written as the...
Tuesday, September 30, 2014

Largest product in a grid : Problem 11 Euler Project

›
In the 20×20 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50...
Sunday, September 7, 2014

Combinatoric selections : Problem 53 Euler Project

›
Combinatoric selections :Problem 53 There are exactly ten ways of selecting three from five, 12345: 123, 124, 125, 134, 135, 145, 234...