Timeline for Does every integer appear in the modular sum sequence?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 10 at 18:58 | comment | added | Seva | @SamHopkins WOW! A bad habit to start working on a problem without studying what have other people done... | |
| Feb 10 at 18:52 | vote | accept | Dominic van der Zypen | ||
| Feb 10 at 18:35 | comment | added | Sam Hopkins | Interestingly this was mentioned in a comment in the above-linked OEIS entry oeis.org/A094405: "Theorem. For all values of n>=397, a(n)=97. Proof. Let s(n) denote Sum[a(i), i=1..n-1]. Calculation shows that s(397)=38606=397*97+97. Thus a(397)=397*97+97 mod 397=97. Then s(398)=s(397)+97=398*97+97, giving a(398)=97. A simple inductive argument shows that a(397+k)=97 for all integers k>=0. - John W. Layman, Jun 07 2004" | |
| Feb 10 at 18:26 | history | answered | Seva | CC BY-SA 4.0 |