From charlesreid1

No edit summary
No edit summary
Line 30: Line 30:


Problem 15 - [[Project Euler/Lattice Paths]] - Finding the number of variations on a route through a lattice.
Problem 15 - [[Project Euler/Lattice Paths]] - Finding the number of variations on a route through a lattice.
Problem 16 - [[Project Euler/Summing the Digits]] - summing up the digits of a large power of 2, 2**1000
Problem 17 - [[Project Euler/Number Spelling]] - spelling out all the numbers from one to a thousand





Revision as of 02:09, 5 July 2017

Problems 1-99

Problem 1 - Project Euler/Multiples of 3 and 5 - printing out all multiples of 3 and 5.

Problem 2 - Project Euler/EvenFibonacci - summing the Fibonacci numbers that are even and less than 4 million

Problem 3 - Project Euler/Largest Prime Factor - Largest prime factor of a given 12-digit number

Problem 4 - Project Euler/Largest Palindrome Product - Largest palindrome product (extracting substrings and sorting)

Problem 5 - Project Euler/LCM - Least common multiple of all the integers from 1 to 20

Problem 6 - Project Euler/SoS - Sum of squares and squares of sums

Problem 7 - Project Euler/Ten Thousand Primes - Find the 10,001st prime.

Problem 8 - Project Euler/Adjacent Digits - Largest product formed by 13 adjacent digits.

Problem 9 - Project Euler/Pythagorean Triplet Sum - Finding a Pythagorean triplet with a specified sum.

Problem 10 - Project Euler/Sum of Primes - Sum of all primes below 2 million.

Problem 11 - Project Euler/Greatest Product in Grid - Finding the greatest product of 4 numbers on a grid.

Problem 12 - Project Euler/Factorable Triangular Numbers - Finding highly factorable triangular numbers

Problem 13 - Project Euler/Sum of Big Numbers - Work out the first 10 digits of a sum of 100 50-digit numbers

Problem 14 - Project Euler/Longest Collatz Sequence - Finding the longest Collatz sequence for starting integers under 1 million

Problem 15 - Project Euler/Lattice Paths - Finding the number of variations on a route through a lattice.

Problem 16 - Project Euler/Summing the Digits - summing up the digits of a large power of 2, 2**1000

Problem 17 - Project Euler/Number Spelling - spelling out all the numbers from one to a thousand



Project 51 - Project Euler/Prime Replacement - Finding the number of primes that can be formed by replacing particular digits of a number


Problems 500-599

Problem 500 - Project Euler/Smallest Number with 2n Factors - Finding the smallest number with 2^n divisors


ye olde linke: https://zach.se/project-euler-solutions/