Search problems

1 problem matches “Euclidean algorithm”. Clear

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

  1. 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}.