Project Euler: About the Solution Series
Solving Project Euler Problems using Javascript!
Dec 31, 20222 min read43
Command Palette
Search for a command to run...
Series
Project Euler: JS Solution Explained!
In this series, I will be discussing Project Euler Solutions. 'Project Euler' helps in improving problem-solving and programming skills.
Remember, there is always a better solution to the problem. 💯
Project Euler: #1 - Multiples of 3 or 5
Problem If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000. Problem Description This is a more straightforward prob...
Jan 1, 20232 min read21
Project Euler: #2 - Even Fibonacci numbers
Problem Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose value...
Jan 2, 20232 min read48
Project Euler: #3 - Largest prime factor
Problem The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143? Problem Description If any given number, N is divisible by x without leaving a reminder, then x is a Factor of the Number N. Similar...
Jan 3, 20233 min read10
Project Euler: #4 - Largest palindrome product
Problem A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Find the largest palindrome made from the product of two 3-digit numbers. Problem Description A palindromic...
Jan 4, 20232 min read52
Project Euler: #5 - Smallest multiple
Problem 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20? Problem Description The Problem is s...
Jan 5, 20233 min read27