Quick fix of my typos:
Day 64: R1 * 2^64 ≡ 0 (mod 2^63) 2^64 is a multiple of 2^63 so the
remainder MUST be 0
OR
R1 * 2^(63 + 1) ≡ 0 (mod 2^63) 2^64 is NOT less than 2^63 and
therefore a multiple 2^63 so the remainder STILL MUST be 0.
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/google-code/97b516e6-316b-4642-b3b2-2caa5ed1c0b9%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
