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.

**Richard**: I wrote a program in C to solve this problem, based on your diagrams but not using your code. It solved the problem in 5 msec. For k up to 7000 it too...**Steven**: Not sure if you're still reading comments on here, but you definitely but like Rok Kralj mentioned in a previous comment you are missing a permutation...**BabakSairafi**: Time=0 for each methodMethod1:f(n,k)=n-k+1+Sigma f(n-k-i,k) from i=0 to n-2k[code language="C#"] class Program { static lon...**BabakSairafi**: Time=0 for each methodMethod1:f(n,k)=n-k+1+Sigma f(n-k-i,k) from i=0 to n-2kclass Program { static long func1(int n, int k...**Beni**: If you consider a primitive triple (a,b,c) such that b-a divides c, then it is not hard to see that b-a = 1. Indeed, any common prime factor of b-a an...**Jean-Marie Hachey**: The least value of n for which p(n) is divisible by one million.3632530092543578593083233157739676164671583617363389322707108646070926860805348954...

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. ☒