A place where I practice coding, do coding competitions, do homework, and help my friends to code.

Project Euler problems PDF

Find the number of ways to make n pence using any number of coins

Find the number of triangle words in the provided array. A PDF File is available for viewing the words. A triangle word is whose word value is a triangle number. A word value is the sum of numbers corresponding to its alphabetical position. For example, SKY has a word value of 55, because 19 + 11 + 25 = 55. SKY is a triangle word, because 55 is …

Solving Project Euler problems

Counts the number of Lychrel Numbers below the limit (e.g. 10000)

Largest product in a series

Find the smallest odd composite that cannot be written as the sum of a prime and twice a square as described in https://projecteuler.net/problem=46

Find the value of D less than or equal to n in minimal solutions of x for which the largest value of x is obtained. n is a number between 2 and 1000.

Triangle Numbers are generated by the formula Tn = n(n+1)/2 - Its numbers are 1, 3, 6, 10, 15,.... Pentagonal Numbers are generated by the formula Pn = n(3n-1)/2 - Its numbers are 1, 5, 12, 22, 35,.... Hexagonal numbers are generated by the formula Hn = n(2n-1) - Its numbers are 1, 6, 15, 28, 45,.... It can be verified that T285 = P165 = H143 = …

Project Euler solutions in Javascript

Find the number of chains, with a starting number below n, that contain exactly sixty non-repeating terms.

My solution for https://projecteuler.net

All Project Euler problems, and my solutions to some of them

Find the sum of the ASCII values in the original text.

Find the side length of the square spiral for which the percent of primes along both diagonals falls below a given percent.

Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through n pandigital, where n is the number of digits.

Find the sum of all numbers which are equal to the sum of the factorial of their digits. Note: As 1! = 1 and 2! = 2 are not sums, they are not included.

Finds the first consecutive number in the consecutive numbers to have a certain number of distinct prime factors each. For example, 14 is the first consecutive number of two consecutive numbers (14 and 15) to have two distinct prime factors.