Maths Olympiad Prep

Library / /416 of 520

Number theory Difficulty 4.5 AIME Prove it

Prove: If the difference between a positive integer's last three digits and the number formed by the digits preceding the last three is divisible by 7 (or 11), then the positive integer is divisible by 7 (or 11).

Solution

Let's denote the last three digits of a positive integer as xx, and the number formed by the digits preceding the last three as yy.

Assume xyx - y is a multiple of 7, meaning xyx - y is divisible by 7.

Then, the integer can be expressed as: 1000y+x=1001y+(xy)1000y + x = 1001y + (x - y),

Since 1001y=143y×71001y = 143y \times 7,

Both 1001y1001y and (xy)(x - y) are multiples of 7,

Therefore, 1000y+x1000y + x is a multiple of 7,

This implies that the positive integer is divisible by 7.

Assume xyx - y is a multiple of 11, meaning xyx - y is divisible by 11.

Then, the integer can be expressed as: 1000y+x=1001y+(xy)1000y + x = 1001y + (x - y),

Since 1001y=91y×111001y = 91y \times 11,

Both 1001y1001y and (xy)(x - y) are multiples of 11,

Therefore, 1000y+x1000y + x is a multiple of 11,

This implies that the positive integer is divisible by 11.

Thus, we have proved that if the difference between a positive integer's last three digits and the number formed by the digits preceding the last three is divisible by 7 (or 11), then the positive integer is divisible by 7 (or 11). The final answer is encapsulated as Proved\boxed{\text{Proved}}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.