The problem: Find the largest product of 4 adjacent numbers in a 20×20 grid. Numbers can be adjacent in any direction, vertical, horizontal, diagonal. http://projecteuler.net/problem=11 My solution (in java):
Here’s the problem: Find the sum of all primes less than 2,000,000 projecteuler.net/problem=10 My solution:
Another one bites the dust! I worked with my brother David on this one, so a big thanks to him for his help. Here’s the problem: The decimal number, 585 = 10010010012 (binary), is palindromic in both bases. Find the sum of all numbers, less than one million, which are palindromic in base 10 and […]
My solution to Project Euler Problem 30. Here’s the problem: Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits: 1634 = 14 + 64 + 34 + 44 8208 = 84 + 24 + 04 + 84 9474 = 94 + 44 + 74 + […]
The problem: Find the sum of all the multiples of 3 or 5 below 1000. My solution was just to use the principle of inclusion/exclusion. No code necessary.
In addition to my work at school and on Programming Praxis exercises, I spend time working on problems from Project Euler. Currently, I have solved 13 problems. My solutions can be found here. I trust my visitors will not use my solutions to cheat on Project Euler problems. First, that’s unethical. Second, there are many […]