EduFarming
Your list · 0हिं

Type at least two letters. Press Esc to close.

↑↓ navigate↵ openTAB cycle filter

Modulo Arithmetic & Congruence · Question 58 of 97

Question 58

MediumOriginal question

x≡3(mod7)x \equiv 3 \pmod{7}. What is (x2+1) mod 7(x^{2} + 1) \bmod 7?

Options for question 58

Show the answer and explanation
CorrectNot quiteAnswer B

Correct answer: B

Explanation

  1. Replace xx by 3: x2+1≡9+1=10x^{2} + 1 \equiv 9 + 1 = 10.

  2. 10 mod 7=310 \bmod 7 = 3.

Worth noting

10 is right but not reduced: a remainder modulo 7 is below 7.

Concept
Using a congruence in a calculation
Typical time
90 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.