Problem #42 is yet another simple question that involves analyzing a file with tons of data. The question reads: Project Euler Problem 42: Coded triangle numbers The nth term of the sequence of triangle numbers is given by, tn = ½n(n+1); so the first ten triangle numbers are: 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, … …
Category Archives: Project Euler Problems
Project Euler Problem #41:
Problem #41 is yet another problem that involves digits in the prime numbers. The question reads: Project Euler Problem 41: Pandigital prime We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime. What is the …
Project Euler Problem #40:
Problem #40 involves an obscure constant in mathematics known as the Champernowne constant. This constant is relevant because it is one of the few numbers that has been proven to be transcendental. The problem reads: Project Euler Problem 40: Champernowne’s constant An irrational decimal fraction is created by concatenating the positive integers: 0.123456789101112131415161718192021… It can …
Project Euler Problem #39:
Problem #39 is one of the many problems on Project Euler that involves Pythagorean Triples. In fact, this type of problem is so common that my solution to this problem is nearly identical to my solution for Problem #9. The question reads: Project Euler Problem 39: Integer right triangles If p is the perimeter of a right …
Project Euler Problem #38:
Problem #38 is one of the many problems on Project Euler that requires permutations of the digits 1-9, also known as pandigitals. The question reads: Project Euler Problem 38: Pandigital multiples Take the number 192 and multiply it by each of 1, 2, and 3: 192 × 1 = 192 192 × 2 = 384 …
Project Euler Problem #37
Problem #37 is yet another question on Project Euler that involves manipulating digits in primes. The question reads: Project Euler Problem 37: Truncatable primes The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and …
Project Euler Problem #36
Problem #36 is one of the many problems on Project Euler that involves binary. The question reads: Project Euler Problem 36: Double-base palindromes The decimal number, 585 = 1001001001_2 (binary), is palindromic in both bases. Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2. (Please …
Project Euler Problem #35:
Problem #35 is one of the many questions on Project Euler that involves manipulating digits in primes. Here is the question: Project Euler Problem 35: Circular Primes The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime. There are thirteen such primes below 100: …
Project Euler Problem #34:
Problem #34 is one of the many Project Euler problems that involves factorials. It involves an obscure type of number called an factorion. Factorions are numbers for which the sum of the factorials of the digits is equal to the number itself. The question reads: Project Euler Problem #34: Digit factorials 145 is a curious …
Project Euler Problem #33:
Problem #33 is yet another question that can be killed with basic brute force. The question reads: Project Euler Problem 33: Digit cancelling fractions The fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that 49/98 = 4/8, which is correct, is obtained by cancelling the …
The Inner Machinations of Walker 