Project Euler: Problem 8

Problem: Find the largest product of any 13 adjacent digits in a 1000 digit number. Solution: Move through the 1000 digit number with a sliding window of 13 digits. For…

Project Euler: Problem 5

Problem: Find the smallest number with all the integers 1 to 20 as factors (i.e. divisible without a remainder). Q. What is the simplest way to find the lowest number…