Monthly Archives: August 2012

Projecteuler.net – Problem 5 – C solution

http://projecteuler.net/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?

Posted in C, Project Euler | Leave a comment

Projecteuler.net – Problem 5 – Python 3 solution

http://projecteuler.net/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?

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 4 – C solution

http://projecteuler.net/problem=4 A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99. Find the largest palindrome made from the product of two 3-digit numbers.

Posted in C, Project Euler | Leave a comment

Projecteuler.net – Problem 4 – Python 3 solution

http://projecteuler.net/problem=4 A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99. Find the largest palindrome made from the product of two 3-digit numbers.

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 3 – C solution

http://projecteuler.net/problem=3 The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ?

Posted in C, Project Euler | Leave a comment

Projecteuler.net – Problem 3 – Python 3 solution

http://projecteuler.net/problem=3 The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ?

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 2 – Python 3 solution

http://projecteuler.net/problem=2 Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … By … Continue reading

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 2 – C solution

http://projecteuler.net/problem=2 Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … By … Continue reading

Posted in C, Project Euler | Leave a comment

Projecteuler.net – Problem 1 – Python 3 solution

http://projecteuler.net/problem=1 If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 … Continue reading

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 1 – C solution

http://projecteuler.net/problem=1 If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 … Continue reading

Posted in C, Project Euler | Leave a comment