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.

**Miguel**: Hi, thanks for the nice explanation! but I dont understand this part:"I did a quick search on oeis and found that for each of the number n, 1/n ha...**Matthew**: Is there any way to find out what the input was that the online judge used for your program? It's a bit hard to find edge cases which don't work if y...**BabakSairafi**: Hi, I wrote this solution only with gcd and no lcm. time for n=40 was 0msfor n=40 in your program, result must longtanx[code language="c...**Miles**: That's brilliant!I spent hours on a variant of this problem:the N is not 1001, id could be up to 10^18; and the sum we wanted is too big, we ...**kyduke**: a = 92604733, b = 92604734 h = sqrt( (a * a) - (b/2 * b/2) ) = 80198051a, b, h are all integer. difference of a and b is 1.I want to know why...**QuasiChameleon**: @Manas SrivastavaAccording to Kristian, the number of distinct possibilities is floor((d(n^2) + 1) / 2), which for 6 becomes floor([(2*a2 + 1)*(2*...

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:

This site uses cookies. ☒