EduFarming
Your list · 0हिं

Type at least two letters. Press Esc to close.

↑↓ navigate↵ openTAB cycle filter

Modulo Arithmetic & Congruence · Question 49 of 97

Question 49

MediumOriginal question

a≡b(modn)a \equiv b \pmod{n} and cc is an integer. Which of the following are always true?

I. a+c≡b+c(modn)a + c \equiv b + c \pmod{n}

II. ac≡bc(modn)ac \equiv bc \pmod{n}

III. a≡b(mod2n)a \equiv b \pmod{2n}

IV. a2≡b2(modn)a^{2} \equiv b^{2} \pmod{n}

Options for question 49

Show the answer and explanation
CorrectNot quiteAnswer D

Correct answer: D

Explanation

  1. Adding, multiplying and raising to a power keep a congruence: if nn divides a−ba - b, it divides (a−b)c(a - b)c and a2−b2=(a−b)(a+b)a^{2} - b^{2} = (a - b)(a + b).

  2. III fails: 1≡4(mod3)1 \equiv 4 \pmod{3}, but 6 does not divide 4−1=34 - 1 = 3.

Concept
Properties of congruence
Typical time
120 s
Your time
—
The rule this testsCongruence modulo n
Practise this chapter →

Ten questions from Modulo Arithmetic & Congruence, at your own pace.

Practise this chapter →

Ten questions from Modulo Arithmetic & Congruence, at your own pace.