Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.
This account is temporarily suspended. The suspension period ends on Sep 22 '27 at 16:45.
1
reputation
4
13

JMP

Computer Graphics

crystal lattice

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

3
answers
9
questions
~677
people reached
  • belbroughton, uk
  • khanacademy.org/profile/JonMarkPerry
  • Member for 4 years, 10 months
  • 223 profile views
  • Last seen Sep 21 at 18:58

Top tags (8)

Score 3
Posts 9
Posts % 75
Score 2
Posts 1
Score 0
Posts 3
Score 0
Posts 2
Score 0
Posts 1
Score 0
Posts 1

Top posts (12) All Questions Answers | Votes Newest

View all questions and answers

Badges (17)

Gold

Silver

4

Rarest

Bronze

13

Rarest