Problem Link to problem. A number chain is created by continuously adding the square of the digits in a number […]
Tag: project-euler
Project Euler #3 – how inefficient is my code?
Problem So I am essentially a complete newbie to programming, and have been attempting to learn Python by completing the […]
How do I add memoization to this problem? [closed]
Problem As it currently stands, this question is not a good fit for our Q&A format. We expect answers to […]
Project Euler #41 – pandigital prime
Problem I’ve written a solution to Euler 41: We shall say that an n-digit number is pandigital if it makes […]
Smallest prime factor of a large number (using BigInteger)
Problem I’m working on a Project Euler problem and am trying to get the smallest prime factor of a BigInteger: […]
Project Euler problem 37: truncatable primes
Problem I am working on Project Euler problem 37 and I have the following program: #!/usr/bin/ruby -w require ‘prime’ h=11 […]
More efficient solution for Project Euler #2 (sum of Fibonacci numbers under 4 million)
Problem I would like to get some feedback on my code. I am starting to program after doing a few […]
Project Euler #15 in haskell
Problem I’ve solved Project Euler #15 in Haskell, but I feel like there might be a better way to express […]
Project Euler #1 – Multiples of 3 and 5
Problem If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, […]
Pythagorean number decomposition
Problem I have a pretty interesting problem that I’m trying to solve, and I am kind of stuck. I want […]