Maths Olympiad Prep

Library / /503 of 520

Number theory Difficulty 7.4 National olympiad, round 2 Find the answer

Example 12 Let m,nm, n be positive integers, and n>1n>1. Find the minimum value of 2m5n\left|2^{m}-5^{n}\right|.

Translate the above text into English, please keep the original text's line breaks and format, and output the translation result directly.

(Note: The note is for you, the assistant, and should not be included in the output.)

Example 12 Let m,nm, n be positive integers, and n>1n>1. Find the minimum value of 2m5n\left|2^{m}-5^{n}\right|.

A number or a short expression. Spacing and $ signs are ignored.

Solution

Since 2m5n\left|2^{m}-5^{n}\right| is an odd number, and when m=7,n=3m=7, n=3, 2m5n=3\left|2^{m}-5^{n}\right|=3, if we can prove that when n>1n>1, 2m5n1\left|2^{m}-5^{n}\right| \neq 1, then the minimum value sought is 3.

If there exist positive integers m,nm, n, such that n>1n>1, and 2m5n=1\left|2^{m}-5^{n}\right|=1, then
2m5n=1 or 2m5n=1.2^{m}-5^{n}=1 \text{ or } 2^{m}-5^{n}=-1 \text{.}

If 2m5n=12^{m}-5^{n}=1, then m3m \geqslant 3. Taking both sides modulo 8, we require
5n7(mod8)5^{n} \equiv 7(\bmod 8)

But for any positive integer nn, 5n15^{n} \equiv 1 or 5(mod8)5(\bmod 8), which is a contradiction. Therefore, 2m5n=12^{m}-5^{n}=1 does not hold.
If 2m5n=12^{m}-5^{n}=-1, then by n>1n>1, we know m3m \geqslant 3. Taking both sides modulo 8, we get
5n1(mod8)5^{n} \equiv 1(\bmod 8)

This implies that nn is even. Let n=2xn=2x, where xx is a positive integer, then
2m=(5x1)(5x+1)2^{m}=\left(5^{x}-1\right)\left(5^{x}+1\right)

Since 5x15^{x}-1 and 5x+15^{x}+1 are two consecutive even numbers, this requires
5x1=2,5x+1=45^{x}-1=2,5^{x}+1=4

which is impossible.
Therefore, the minimum value of 2m5n\left|2^{m}-5^{n}\right| is 3.

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.