101
reputation
1
1
5
JMP
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
-
belbroughton, uk
-
Member for 4 years, 7 months
-
2 profile views
-
Last seen Jul 23 '17 at 13:15
Communities (171)
Top network posts
Keeping a low profile.
This user hasn't posted yet.
Badges (7)
Gold
1
Rarest
-
Feb 2 '16
Silver
1
Rarest
-
Dec 5 '15
Bronze
5
Rarest
-
Oct 30 '15
-
Oct 30 '15
-
Oct 30 '15
