Problem #22 is yet another simple question that involves analyzing a large amount of data. The question reads: Project Euler Problem 22: Names scores Using names.txt (right click and ‘Save Link/Target As…’), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for …
Category Archives: Project Euler Problems
Project Euler Problem #21:
Problem #21 features an obscure type of number known as an amicable number. The problem reads: Project Euler Problem 21: Amicable numbers Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). If d(a) = b and d(b) = a, where a ≠ b, …
Project Euler Problem #20:
Problem #20 is quite surprisingly the first problem to feature the factorial. I’d explain it, but the question already does it for me. Here’s the question: Project Euler Problem 20: Factorial digit sum n! means n x (n-1) x . . . x 3 x 2 x 1 For example, 10! = 10 x 9 …
Project Euler Problem #19:
Problem #19 is similar to Problem #17 in that it is very painful to implement unless you use an external library in whatever programming language you work in. The question reads: You are given the following information, but you may prefer to do some research for yourself. 1 Jan 1900 was a Monday. Thirty days …
Project Euler Problem #18:
Problem #18 is one of the first problems on Project Euler to prominently feature DP (Dynamic Programming) and the first to explicitly be part of a series of similar problems. The problem reads: Project Euler Problem 18: Maximum path sum I By starting at the top of the triangle below and moving to adjacent numbers …
Project Euler Problem #17:
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 + …
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 …
The Inner Machinations of Walker 