Question

Difficulty: HardProperties of Integers and Divisibility

What is the least positive integer nn that leaves a remainder of 33 when divided by 77, a remainder of 44 when divided by 55, and is divisible by 99?

Answer: 234

Answer

The least positive integer satisfying all three conditions is 234.
To find the least positive integer nn that satisfies n3(mod7)n \equiv 3 \pmod{7}, n4(mod5)n \equiv 4 \pmod{5}, and n0(mod9)n \equiv 0 \pmod{9}, we first find a general expression for integers meeting the first two conditions. Checking values of 5m+45m + 4 modulo 7 gives 2424 as the smallest positive integer matching both. The combined condition is n24(mod35)n \equiv 24 \pmod{35}, or n=35k+24n = 35k + 24. Requiring 35k+2435k + 24 to be divisible by 9 gives 8k+60(mod9)8k + 6 \equiv 0 \pmod{9}, which simplifies to k6(mod9)k \equiv 6 \pmod{9}. The smallest non-negative integer value for kk is 66, leading to n=35(6)+24=234n = 35(6) + 24 = 234.

Step-by-Step Solution

1
Set up system of modular congruences for the remainders
n3(mod7)n \equiv 3 \pmod{7}, n4(mod5)n \equiv 4 \pmod{5}, and n0(mod9)n \equiv 0 \pmod{9}
Translates the remainder and divisibility conditions into mathematical equations.
2
Combine the first two congruences using the Chinese Remainder Theorem approach
n24(mod35)n \equiv 24 \pmod{35}, so n=35k+24n = 35k + 24 for an integer k0k \ge 0
Since lcm(5,7)=35\text{lcm}(5, 7) = 35, the solutions to the combined system repeat every 35 integer values.
3
Enforce the divisibility condition by 9 on n=35k+24n = 35k + 24
35k+240(mod9)    8k+60(mod9)    k+60(mod9)    k6(mod9)35k + 24 \equiv 0 \pmod{9} \implies 8k + 6 \equiv 0 \pmod{9} \implies -k + 6 \equiv 0 \pmod{9} \implies k \equiv 6 \pmod{9}
Reduces coefficients modulo 9 to find the values of kk that make nn a multiple of 9.
4
Calculate the smallest positive integer nn corresponding to k=6k = 6
n=35(6)+24=234n = 35(6) + 24 = 234
Choosing k=6k = 6 yields the smallest non-negative integer for kk that satisfies all conditions.

Key Concept

Simultaneous congruences and divisibility constraints
Rate this question