Question

Difficulty: MediumProperties of Integers and Divisibility

When the positive integer nn is divided by 99, the remainder is 55. What is the remainder when n2+4n+7n^2 + 4n + 7 is divided by 99?

Answer: 7

Answer

The remainder when n2+4n+7n^2 + 4n + 7 is divided by 99 is 77.
Any positive integer nn that leaves a remainder of 55 when divided by 99 can be represented as n=9k+5n = 9k + 5 for some non-negative integer kk. Substituting this into n2+4n+7n^2 + 4n + 7 yields (9k+5)2+4(9k+5)+7=81k2+90k+25+36k+20+7=81k2+126k+52(9k + 5)^2 + 4(9k + 5) + 7 = 81k^2 + 90k + 25 + 36k + 20 + 7 = 81k^2 + 126k + 52. Since 81k281k^2 and 126k126k are both divisible by 99, the remainder of the entire expression when divided by 99 is determined entirely by 5252. Dividing 5252 by 99 gives 52=9×5+752 = 9 \times 5 + 7, so the final remainder is 77.

Step-by-Step Solution

1
Express the integer nn in terms of its remainder upon division by 99.
n=9k+5n = 9k + 5 for some non-negative integer kk, or equivalently n5(mod9)n \equiv 5 \pmod{9}.
By the division algorithm, any integer divided by 99 can be written as a multiple of 99 plus the remainder.
2
Substitute n5(mod9)n \equiv 5 \pmod{9} into the polynomial expression n2+4n+7n^2 + 4n + 7.
n2+4n+752+4(5)+7=25+20+7=52(mod9)n^2 + 4n + 7 \equiv 5^2 + 4(5) + 7 = 25 + 20 + 7 = 52 \pmod{9}.
Properties of modular arithmetic allow substitution of remainder values into polynomial expressions.
3
Find the remainder of 5252 when divided by 99.
52=9×5+752 = 9 \times 5 + 7, which gives a remainder of 77.
Dividing 5252 by 99 yields a quotient of 55 and a remainder of 77, which is strictly between 00 and 88.

Key Concept

Properties of Integer Remainders and Modular Substitution
Estimated Time:1m 15s
Rate this question