If and are the numbers satisfying the system of linear congruence above, find the sum of the remainders when and are divided by 16 individually.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
{ 7 x + 3 y ≡ 1 0 (mod 16) 2 x + 5 y ≡ 9 (mod 16) . . . ( 1 ) . . . ( 2 )
{ ( 1 ) × 5 : ( 2 ) × 3 : 3 5 x + 1 5 y ≡ 5 0 (mod 16) 6 x + 1 5 y ≡ 2 7 (mod 16) . . . ( 3 ) . . . ( 4 )
( 3 ) − ( 4 ) : 2 9 x 1 3 x ⟹ x ≡ 2 3 (mod 16) ≡ 7 (mod 16) ≡ 3
( 1 ) : 2 1 + 3 y 5 + 3 y 3 y ⟹ y ≡ 1 0 (mod 16) ≡ 1 0 (mod 16) ≡ 5 (mod 16) ≡ 7
⟹ x + y ≡ 3 + 7 ≡ 1 0 (mod 16)