Category: Projects
-
Project Euler #5
Problem 5 asks: “What is the smallest number divisible by each of the numbers 1 to 20?” Instead of 20, we will consider the question for any natural number. This is a great question as it gets you to start thinking about number theory! Specifically, how numbers are composed as the products of primes. As…
-
Project Euler Problem #4 – Palindromic Numbers
Problem 4 asks us to “Find the largest palindrome made from the product of two 3-digit numbers.” First we know our maximum factor is 999, which safely puts our possible palindromes in the 6 digit range. This is important because of the proof that all even-digit palindromes have 11 as a factor. I use this…
Chris Bowden 