Suppose that a and b are integers, a≡ 11(mod 19), and b≡ 3(mod 19). Find the integer c with 0 <= c <= 18 such that c≡ a-b(mod 19)

suffisantfn

suffisantfn

Open question

2022-08-19

Suppose that a and b are integers, a11(bmod19), and b3(bmod19). Find the integer c with 0c18 such that cab(bmod19)

Answer & Explanation

Giovanni Salazar

Giovanni Salazar

Beginner2022-08-20Added 4 answers

Definitions
Division algorithm Let a be an integer and d a positive integer. Then there are unique integers q and r with 0r<d such that a=dq+r
q is called the quotient and r is called the remainder
q=a ÷ d
r=abmodd
Theorem 5 Let m be a positive integer. If ab(bmodm) and cd(bmodm), then a+cb+d(bmodm) and acbd(bmodm).
Solution
a=11(bmod19)
b3(bmod19)
0c18
Use theorem 5:
cab(bmod19)
=113(bmod19)
=8(bmod19)
We then obtain c=8 with 0c18.

Do you have a similar question?

Recalculate according to your conditions!

New Questions in High school geometry

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?