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.

**Gary Walker**: I took a different approach. To me the solutions was to recognize that counting the total number of rectangles was the product of 2 triangle numbers. ...**Jonathan de La Marche**: @mat10tng: You can't make jumps, because there could be 3, 4 or even more consecutive numbers that fulfill the condition. For example: 33 = 3 * 1...**Jean-Marie Hachey**: Just a note. No prime numbers were found in the list of one-hundred 50-digit numbers of Project Euler - Problem 13 : http://projecteuler.net/index.p...**JohnRobin**: There is a far easier way to solve this. Instead, initialize a set K = [2,12000] and iterate upward trough N. if any N has any product-sum still in K,...**guenter**: hi there is a typo in your program. From your argumentation follows that the fo loop should start with i = 9487 regards g...**Stefan Gruenwald**: from math import sqrt from decimal import * getcontext().prec = 105result=0 for i in xrange(1,101): temp=sum(map(int,list(str(int(Dec...

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: