Category Archives: Python

Projecteuler.net – Problem 24 – Java & Python 3

http://projecteuler.net/problem=24 This problem involves lexicographic permutation. I tried my hand coding it both in Java and Python. The python code is noticeably more compact, but is also really slow. I followed an algorithm on lexicographic permutation found on Wikipedia. Generation … Continue reading

Posted in Java, Project Euler, Python | Leave a comment

Projecteuler.net – Problem 11 – Python 3 solution

http://projecteuler.net/problem=11 In the 2020 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 … 32 98 … Continue reading

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 10 – Python 3 solution

http://projecteuler.net/problem=10 The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million.

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 9 – Python 3 solution

http://projecteuler.net/problem=9 A Pythagorean triplet is a set of three natural numbers, abc, for which, a2 + b2 = c2 For example, 32 + 42 = 9 + 16 = 25 = 52. There exists exactly one Pythagorean triplet for which a + b + c = … Continue reading

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 8 – Python 3 solution

http://projecteuler.net/problem=8 Find the greatest product of five consecutive digits in the 1000-digit number. 731671765313 … … 0420752963450

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 7 – Python 3 solution

http://projecteuler.net/problem=7 By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001st prime number?

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 6 – Python 3 solution

http://projecteuler.net/problem=6 The sum of the squares of the first ten natural numbers is, 12 + 22 + … + 102 = 385 The square of the sum of the first ten natural numbers is, (1 + 2 + … + … Continue reading

Posted in Project Euler, Python | 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 – 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 – 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