Advanced Search
Search Results
10 total results found
Project Euler 100
Write-ups on the first 100 Project Euler problems. I do not want to break policy, so I am only publicly posting the first 100.
Euler 0001
The Problem: Listing all multiples of 3 and 5 under 1000.Given: 3,5,6,9 are all multiples of 3 and 5 below 10. Considerations: We could iterate through every multiple of these numbers but there is going to be overlap when their multiples are divisible by bo...
Euler 0002
The Problem: Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with and , the first terms will be: 1,2,3,5,8,13,21,34,55,89 By considering the terms in the Fibonacci sequence whose values do not exceed four mi...
Euler 0003
The Problem: The prime factors of 13195 are 5, 7, 13, and 29.What is the largest prime factor of the number 600951475143? Considerations: There are a lot of approaches, of which I will probably use later. We are going to start with some basic sieving and t...
Euler 0004
The Problem: 9009 is a palindromic number since it can be read forwards and backwards the same. It is the product of 91*99 and is the largest palindromic number generated by the product of 2 2-digit numbers. What is the largest palindromic number that is the...
Euler 0005
The Problem: 2520 is the smallest number evenly divisible by the numbers 1 through 10. What is the smallest number evenly divisible by the numbers 1 through 20? Considerations: With the context provided we now know:- That our function should produce 2520 w...
Euler 0006
The Problem: The sum of squares n is defined by the sum of natural numbers ascending, such that, sum_of_squares(10) is 385. 1^2 + 2^2 + ... 10 ^2. The square of sum n is defined by the square of the sum of natural numbers ascending, such that, square_of_sum(...
Euler 0007
The Problem: Prime numbers are numbers that are only divisible by themselves and 1. Let's generate primes!What is the 1001st prime? The Approach: We can re-use some of the prime factorization code, and just check the stacked prime factors that we have accum...
Euler 0008
The Problem: In this giant 1000 digit number the greatest product of 4 adjacent numbers is 9*9*8*9 = 5832We need to find the greatest 10 adjacent numbers 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 ...
Euler 0009
The Problem: A pythagorean triple is such that integers a, b, c can be a^2 + b^2 = c^2. There exists a pythagorean triple that sum total of a + b + c = 1000. Find it. The Approach: As a relatively naive approach:- We can iterate through a and b and take th...