If the day in question is the xth (counting from and including the first monday), then x=1+2k1=2+3k2=3+4k3=4+k4=5+6k5=6+5k6=7k7
where the \mathrm{k} are integers ie
(1)x≡1(mod2),(2)x≡(mod3),(3)x≡3(mod4)(4)x≡4(mod1),(5)x≡5(mod6),(6)x≡6(mod5)(7)x≡0(mod7)
Of these congruences, (4) is no restriction and (1) and (2) are included in (3) and (5).
Of the two later, (3) shows that x is congruent to 3,7, or 11(mod12) , and (5) that x is congruent
to 5 or 11 , so that (3) and (5) together are equivalent to x≡11(mod12) . Hence the problem is that of solving
x≡11(mod12),x≡6(mod5),x≡0(mod7)
x≡−1(mod12),x≡1(mod5),x≡0(mod7)
Here m1=12, m2=5, m3=7, m=420,M1=35,M2=84,M3=60 .
The n are given
35n1≡1(mod12),84n2≡1(mod5),60n≡1(mod7)
or
−n1≡1(mod12),−n2≡1(mod5),4n3≡1(mod7)
and we can take n1=−1,n2=−1,n3=2 . Hence
x=(−1)(−1)35+(−1)1.84+2.0.60=−49≡371(mod420)
The first x satisfying the condition is 371 .
Comments