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.

**Shruti**: In the line where aodd is assigned: int aodd = (i % 2 == 0) ? -1 : 0;Shouldn't it have been: int aodd = (bPos[i] % 2 == 0) ? -1 : 0;...**Allen Conti**: My interest in the Fermat Conjecture, (FC,) began as an interest in the Pythagorean theorem. I wasn't looking for other integral solutions to the n gr...**fahim**: can u plz tell me why i'm getting a runtime error?here is my code:import java.io.*; import java.util.Scanner;class Flip2 {public sta...**Julian**: Solution: Duration in ms: 29maxN: 71 maxA: -61 maxB: 971 maxA * maxB = -59231 Code:import java.util.BitSet; import java.util.HashSet; ...**Neha Arora**: Hello,Your solution shows product numm for 5 adjacent places but Problem 8 of Project Euler asks for product of 13 adjacent places and I doubt, i...**Neha Arora**: Hello, In Project Euler, Problem 8, the solution required is for 13 adjacent digits but your solution only shows it for 5 places. In case of 13 adjac...

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: