EduFarming
Your list · 0हिं

Type at least two letters. Press Esc to close.

↑↓ navigate↵ openTAB cycle filter

Modulo Arithmetic & Congruence · Question 54 of 97

Question 54

MediumOriginal question

What is 4,567,891 mod 94{,}567{,}891 \bmod 9?

Options for question 54

Show the answer and explanation
CorrectNot quiteAnswer D

Correct answer: D

Explanation

  1. 10≡1(mod9)10 \equiv 1 \pmod{9}, so every power of 10 is ≡1\equiv 1, and a number is congruent to the sum of its digits.

  2. 4+5+6+7+8+9+1=404 + 5 + 6 + 7 + 8 + 9 + 1 = 40, and 40 mod 9=440 \bmod 9 = 4.

Worth noting

1 is the last digit, which gives the remainder by 10, not by 9.

Concept
The remainder by 9 from the digit sum
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.