Computer Graphics

Chinese Remainder Theorem

$x=bm^2 + a(m+1)$ solves $x\equiv a \pmod m \land x\equiv b \pmod{m+1}$.
$x=2k^2(a+b) + k(a-b)$ solves $x\equiv a \pmod{2k-1} \land x\equiv b \pmod{2k+1}$.
$x=a(3k+r+3)((3-r)k+1)+b(3k+r)(rk+2r-1)$ solves $x\equiv a \pmod{3k+r} \land x\equiv b \pmod{3k+r+3}$.

Consider 3k+r, 3k+r+3 where r=1 or 2. Then:
(3k+r+3)((3-r)k+1) gives 50: 1mod7, 0mod10, and 33: 1mod8, 0mod11
(3k+r)(rk+2r-1) gives 21: 0mod7, 1mod10, and 56: 0mod8, 1mod11

Wit section

Person A:

There are always two sides to every argument.

Person B:

No there aren't.

I'm not insane - everybody else is and I'm the only sane one.