Problem #12 is the first of many Project Euler problems to feature multiplicative functions. A multiplicative function is a function f such that for all natural numbers x and y such that gcd(x,y)=1, f(xy) = f(x) * f(y). One of the most common multiplicative functions is the Divisor Function, or the function which returns the …
Category Archives: Project Euler Problems
Project Euler Problem #11:
Problem #11, like Problem #8, is one of the many Project Euler problems that requires the user to analyze a large amount of data. Here is its statement: Project Euler Problem 11: Largest product in a grid In the 20 x 20 grid below, four numbers along a diagonal line have been marked in red. …
Project Euler Problem #10:
Problem #10 is an example of how some common functions that are used in certain problems can also be used for other problems down the line. In my post for Problem #7, I discussed the Sieve of Eratosthenes, and I presented an implementation of it in Python 2.7. Perhaps unsurprisingly, this function can be used …
Project Euler Problem #9:
Problem #9 features what is possibly the most famous theorem in all of mathematics: The Pythagorean Theorem. However, unlike typical discussion of the Pythagorean Theorem which involves right triangles in Euclidean geometry, this problem is more concerned with investigating the theorem as a Diophantine Equation. The problem reads: Project Euler Problem 9: Special Pythagorean triplet …
Project Euler Problem #8:
Problem #8 is the first of many to involve finding some answer among a large amount of data. In this case, we are asked to investigate a crazy 1000-digit number. Here is the statement of the problem: Project Euler Problem 8: Largest product in a series The four adjacent digits in the 1000-digit number that …
Project Euler Problem #7:
Problem #7 is one of the many problems on Project Euler which concerns prime numbers. The question reads: Project Euler Problem 7: 10001st prime 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 10,001st prime number? As discussed …
Project Euler Problem #6:
Problem #6 of Project Euler is yet another example of how having a decent background in math can save you a lot of hassle when solving coding problems. The question reads: Project Euler Problem 6: Sum Square Difference The sum of the squares of the first ten natural numbers is 1^2 + 2^2 + . …
Project Euler Problem #5:
Project Euler Problem #5 is another question that is feasibly do-able by hand but can also be generalized. The problem reads: Project Euler Problem 5: Smallest Multiple 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 …
Project Euler Problem #4
Today we have Problem #4: The first of many to feature palindromic numbers. A palindrome is defined as a number that reads the same from left to right and from right to left. Unless otherwise specified, the term refers to palindromes in base 10. Here is the statement of this problem: Project Euler Problem 4: …
Project Euler Problem #3
While Problem #2 of Project Euler may have featured the very common Fibonacci numbers, Problem #3 is the first to feature the super common prime numbers. Here is the statement of Problem #3: Project Euler Problem 3: Largest Prime Factor The prime factors of 13195 are 5, 7, 13 and 29. What is the largest …
The Inner Machinations of Walker 