Basic Problems About Congruence 2

Find the smallest positive integer x that satisfies the following systems of congruence equations. \[x\equiv 3(mod7)\] \[x\equiv 1(mod9)\] \[x\equiv 8(mod13)\]

×

Problem Loading...

Note Loading...

Set Loading...