Search problems

7 problems match “congruences”. Clear

Visitors search a sample. Sign in for free to search every problem. Sign in

  1. Congruences with non-coprime moduli ●○○○○ 10 ptsFind the smallest positive integer xx such that x≡3(mod4)x \equiv 3 \pmod{4} and x≡1(mod6)x \equiv 1 \pmod{6}.
  2. Integer with two remainders below 100 ●○○○○ 10 ptsA positive integer xx less than 100 leaves remainder 2 when divided by 7, and remainder 8 when divided by 10. Find xx.
  3. Smallest integer with two remainders ●●○○○ 20 ptsWhat is the smallest positive integer that leaves a remainder of 4 when divided by 5 and a remainder of 6 when divided by 7?
  4. Simultaneous congruences modulo 15 and 21 ●●○○○ 20 ptsFind the smallest positive integer xx such that x≡5(mod15)x \equiv 5 \pmod{15} and x≡8(mod21)x \equiv 8 \pmod{21}.
  5. CRT with non-coprime moduli ●●○○○ 20 ptsFind the smallest positive integer xx such that x≡1(mod8)x\equiv 1 \pmod 8 and x≡5(mod12)x\equiv 5 \pmod{12}.
  6. Smallest solution of a linear congruence ●●○○○ 20 ptsWhat is the smallest positive integer xx that satisfies the congruence 30x≡42(mod47)30x \equiv 42 \pmod{47}?
  7. Solving a four-congruence CRT system ●●●○○ 50 ptsFind the least nonnegative integer xx satisfying x≡4(mod5)x \equiv 4 \pmod{5}, x≡2(mod7)x \equiv 2 \pmod{7}, x≡2(mod11)x \equiv 2 \pmod{11} and x≡12(mod13)x \equiv 12 \pmod{13}.