Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Divisible by 7 (2016). Parent comment
A number in base $n$ is just $a*n^2+b*n^1+c$.
Because $n mod n-1 = 1$, you can replace every $n$ with $1$.
So $a*n^2+b*n^1+c mod n-1$ becomes $a+b+c mod n-1$
There are no comments on this comment yet.
A number in base $n$ is just $a*n^2+b*n^1+c$.
Because $n mod n-1 = 1$, you can replace every $n$ with $1$.
So $a*n^2+b*n^1+c mod n-1$ becomes $a+b+c mod n-1$