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.

**Julian**: Ok, I give up. The code has been cut off again......**Julian**: Mh, a piece of code was cut of, sorry.[code language="java"][/code] int checkNr = 209; // 2*3*5*7 = 210 -> -1 because the number will be inc...**Julian**: Here is my solution. I did not use a prime list and the solution took me 15 ms.[code language="java"][/code] int checkNr = 209; // 2*3*5*7 = 210 ...**Julian**: This is my solution. I did not see, that the pentagonals are a subset of the triangles, so I checked for both. Nevertheless my code runs in 0 ms. Lan...**Julian**: Here a very dirty example, but the solution is correct and it took 0 ms. [code language="java"] import java.math.BigInteger; public class P_043_Sub...**aa1992**: instead of starting the loop from 2..it can be more optimised by starting it from 10;As single digit numbers are avoided...

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: