Smallest Multiple Algorithm using Bruteforce or GCD/LCM
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest positive number that is …
Tag: project euler
How many different ways can £2 be made using any number of coins? (Depth First Search and Dynamic Programming)
In the United Kingdom the currency is made up of pound (£) and pence (p). There are eight coins in general circulation: 1p, 2p, 5p, 10p, 20p, 50p, £1 …
Compute Factorial Digit Sum: Find the sum of the digits in the number 100!
n! means n × (n − 1) × … × 3 × 2 × 1 For example, 10! = 10 × 9 × … × 3 × 2 × …
Compute the Maximum Integer Right Triangles Solutions
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 …
Power Digit Sum: What is the sum of the digits of the number 2^1000?
215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of …