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.

**Kalle**: Funny thing about the number 16475640049 is that it is the 9th number which is both triangular and heptagonal, see https://oeis.org/A039835...**joy**: hey thanks so much for this solution. this was very helpful for a novice like me....**Antonio Sanchez**: The key to speeding this up is to reduce redundant checks. Since you need all of (p,q), (p,r) and (q,r) to appear in your list of pairs, you can safe...**Rob**: Here's how I worked it out: - 1/1/1901 starts on a Tuesday (Start day is 2). - Using the rules given I work out the day count for each month. - I k...**Rob**: The number of routes possible on each node of the grid is a number on pascals triangle. Here you can specify a width and height for the grid. If n = ...**Adhyyan**: As a 14 year old programmer I found this extremely helpful and without this I wouldn't be able to write my own algorithm. Even though i have trouble u...

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