Problem #17 is the first of many Project Euler problems that are very easy with certain libraries, but are painful to implement otherwise. Here is the question: Project Euler Problem 17: Number letter counts If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + …
Tag Archives: Coding
Project Euler Problem #16:
Problem #16 is another example of how some problems are much simpler in certain languages than other languages, and like Problem #13, it is a possible contender for the simplest Project Euler question. The question reads: Project Euler Problem 16: Power digit sum 2^15 = 32768 and the sum of its digits is 3 + …
Project Euler Problem #15:
Problem #15 is yet another example of how having a decent background in mathematics can give you a huge edge in tackling Project Euler. The question reads: Project Euler Problem 15: Lattice paths Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there …
Project Euler Problem #14:
Problem #14 is the first of many Project Euler problems to feature the Collatz Sequence. The Collatz Sequence, named from the infamous Collatz Conjecture, is the sequence of numbers that follow an arbitrary starting integer “n” when the following process is performed: If x is the current number, whenever x is even, divide x by …
Project Euler Problem #13:
Problem #13 is a good contender for the most basic Project Euler problem, depending on what programming language you use. Like Problems 8 and 11, this problem involves analyzing a ridiculous amount of data. However, unlike those problems, the iteration this one requires you to do is so simple that it’s one of the first …
Project Euler Problem #12:
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 …
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 …
The Inner Machinations of Walker 