All your doing here is 37-19 adding negative is the same has munising
So 37-19=18
I believe the answer would be B. 11 because you can see a pattern. Its just skipping.
Answer:
Ok..
Step-by-step explanation:
Answer:
Step-by-step explanation:
You're looking for the largest number <em>x</em> such that
<em>x</em> ≡ 1 (mod 451)
<em>x</em> ≡ 4 (mod 328)
<em>x</em> ≡ 1 (mod 673)
Recall that
<em>x</em> ≡ <em>a</em> (mod <em>m</em>)
<em>x</em> ≡ <em>b</em> (mod <em>n</em>)
is solvable only when <em>a</em> ≡ <em>b</em> (mod gcd(<em>m</em>, <em>n</em>)). But this is not the case here; with <em>m</em> = 451 and <em>n</em> = 328, we have gcd(<em>m</em>, <em>n</em>) = 41, and clearly
1 ≡ 4 (mod 41)
is not true.
So there is no such number.
