News for hackers. Stuff that matters.
Re:Project Euler 001 the Hard Way by philiplu on Sunday February 02, 2020 @12:40PM (#22218115)
The problem is a bit underspecified, perhaps. 'n' is a positive integer, so 1, 2, 3, .... So the sequence is found by multiplying 1504170715041707 by 1, 2, 3, ... sequentially, then finding the remainder when you divide each of those products by 4503599627370517.

There are no comments on this comment yet.