3 ms·
From the problem 700: Consider the sequence 1504170715041707n mod 4503599627370517 Could you explain what 'n mod' means? Google doesn't seem to know what
by fctorial 7y ago
From the problem 700:
Consider the sequence 1504170715041707n mod 4503599627370517
Could you explain what 'n mod' means? Google doesn't seem to know what that is.
- stevelosh 7y ago`n` is the position in the sequence: n=1 = (mod (* 1504170715041707 1) 4503599627370517) = 1504170715041707 n=2 = (mod (* 1504170715041707 2) 4503599627370517) = 3008341430083414 n=3 = (mod (* 1504170715041707 3) 4503599627370517) = 8912517754604
- philiplu 7y agoThe 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.