Advanced Search
Search Results
5 total results found
Project Euler
Write-ups on Project Euler problems
Euler 0001
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 both o...
Euler 0002
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 million...
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? The considerations: There are a lot of approaches, of which I will probably use later. We are going to start with some basic sieving a...
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...