You can follow the discussion on **Project Euler 13: Sum of 50-digit numbers** without having to leave a comment. Just enter your email address in the form here below and you’re all set.

You can follow the discussion on **Project Euler 13: Sum of 50-digit numbers** without having to leave a comment. Just enter your email address in the form here below and you’re all set.

Grab the RSS feed for Free Updates!

(What's this? — Learn more about RSS)

subscribe

OR Get blog updates sent directly to your inbox by entering your email address below:

- Project Euler 267: Billionaire
- Making decisions under uncertainty in everyday life
- Taking a break
- Project Euler 146: Investigating a Prime Pattern
- Project Euler 145: How many reversible numbers are there below one-billion?
- UVa Online Judge New Platform
- Project Euler 144: Investigating multiple reflections of a laser beam.
- Project Euler 143: Investigating the Torricelli point of a triangle
- Project Euler 142: Perfect Square Collection
- Project Euler 141:Investigating progressive numbers, n, which are also square.

**James**: I think I worded my response poorly, I was referring to the situation where there would be two 8's in the solution. What I meant was we know that a va...**Jean-Marie Hachey**: Excerpt from the statement of Problem Euler 80: "The square root of two is 1.41421356237309504880..., and the digital sum of the first one hundred de...**Kristian**: This is certainly not the easiest problem to being wrapping your head around dynamic programming, and I am not sure if I have explained it well enough...**Kristian**: You might be right. I am uncertain about it when reviewing the question. Can't you come in a situation where you have a carryover from the previous d...**Kristian**: I simply use the numbers in binary form, and if I encounter a 0 I go left and if I encounter a 1 I go right.So if you have a pyramid that is 3 lev...**Kristian**: I don't know how much it is about reading books. I think a lot of it comes from practice. In my case I picked up a lot of the prerequisites for solvin...

Algebra API Arithmetic BigInteger Brute Force C# Calculus Combinatorics Competition Continued fractions Coprimes Diophantine Equation Dynamic Programming Euler's totient function Factorial Fibonacci Fractions Geometry Greatest Common Divisor Induction Java Jokes Linear Algebra Links Modulo Palindromes Pandigital Pell's equation Pen & Paper Pentagonal numbers Permutations Prime factorisation Prime Generation Prime numbers Programming Project Euler Proofs Pythagoras Recursion Repunit Sequences String Manipulation Teaching UVa Online Judge Video

search#### Search the Site: