Olympiad Maths Prep

Library / /16 of 21

Number theory Difficulty 6.0 National olympiad Prove it Ukraine

When dividing with remainder some four consecutive positive integers by some three-digit integer it turned out, that the sum of these four remainders is equal to 983983. Find the remainder under the division of the smallest of these four numbers by 109109.

Solution

Denote these four consecutive integers by nn, n+1n+1, n+2n+2 and n+3n+3. Denote the three-digit number that we were dividing by as bb. Let n=bq+rn = bq + r. Consider possible values of rr.

If rb4r \le b - 4, then these remainders are rr, r+1r+1, r+2r+2 and r+3r+r+1+r+2+r+3=9834r=973r+3 \Rightarrow r + r+1 + r+2 + r+3 = 983 \Rightarrow 4r = 973, contradiction.

If r=b3r = b - 3, then these remainders are rr, r+1r+1, r+2r+2 and 0r+r+1+r+2+0=9833r=9800 \Rightarrow r + r+1 + r+2 + 0 = 983 \Rightarrow 3r = 980, contradiction.

If r=b2r = b - 2, then these remainders are rr, r+1r+1, 00 and 1r+r+1+0+1=9832r=9811 \Rightarrow r + r+1 + 0 + 1 = 983 \Rightarrow 2r = 981, contradiction.

If r=b1r = b - 1, then these remainders are rr, 00, 11 and 22 \Rightarrow
r+0+1+2=983r=980b=r+1=981. r + 0 + 1 + 2 = 983 \Rightarrow r = 980 \Rightarrow b = r + 1 = 981.
It remains to find the required remainder:
n=bq+r=981q+980=109(9q+8)+108. n = bq + r = 981q + 980 = 109(9q + 8) + 108.

Looking for a route rather than an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.