Select Page

## Project Euler #13 – Large Sum

Problem 13: Work out the first ten digits of the sum of the following one-hundred 50-digit numbers....

## Project Euler #5 – Smallest Multiple

Problem 5: 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 evenly divisible by all of the numbers from 1 to 20? #initialize variables x = 1 #function to check if...

## Project Euler #10 – Summation of Primes

I skipped a bunch of questions and landed on this one. I’ll revisit the others… have no worries! Euler, again. Source: https://commons.wikimedia.org/wiki/File:Leonhard_Euler.jpg Problem 10:The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.Find the sum...

## Project Euler #2

Wow. It’s been a longtime since I’ve made a post here. Let’s just say… life has been hectic. I’ve been spending some time with Python and web scraping. It’s been a whole bunch of fun. There’s no better feeling than setting up...

## Project Euler #1

Add all the natural numbers below one thousand that are multiples of 3 or 5. Seems simple enough? Here’s my brute force way of answering it (using Python): #initiate the counters n = 1 sumTo = 0 #iterate up to 1000, adding natural numbers that are multiples of 3...