1
vote
3answers
219 views

could not able to understand Project Euler 18. “Maximum path sum I”

According to question, By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. ...
4
votes
3answers
2k views

10 most significant digits of the sum of a 100 50-digit numbers

This is about Project Euler #13. You are given a 100 50-digit numbers and are asked to calculate the 10 most significant digits of the sum of the numbers. The solution threads stated that we are only ...
12
votes
1answer
535 views

Comparing powers without logarithms

Related to this question and this Project Euler problem (Problem 99), I came up with a recursive algorithm for comparing two numbers of the form $x^y$ (with $x>1$ and $y\ge 0$) without explicit use ...
3
votes
2answers
210 views

Faulty logic when summing large integers?

This is in relation to the Euler Problem $13$ from http://www.ProjectEuler.net. Work out the first ten digits of the sum of the following one-hundred $50$-digit numbers. ...