Maths Olympiad Prep

Library / /1347 of 1394

Number theory Difficulty 6.2 National Olympiad Prove it United States

Problem:

For any odd positive integer nn, let r(n)r(n) be the odd positive integer such that the binary representation of r(n)r(n) is the binary representation of nn written backwards. For example, r(2023)=r(111111001112)=111001111112=1855r(2023) = r\left(11111100111_{2}\right) = 11100111111_{2} = 1855. Determine, with proof, whether there exists a strictly increasing eight-term arithmetic progression a1,,a8a_{1}, \ldots, a_{8} of odd positive integers such that r(a1),,r(a8)r\left(a_{1}\right), \ldots, r\left(a_{8}\right) is an arithmetic progression in that order.

Solution

Solution:

The main idea is the following claim.

Claim: If a,b,ca, b, c are in arithmetic progression and have the same number of digits in their binary representations, then r(a),r(b),r(c)r(a), r(b), r(c) cannot be in arithmetic progression in that order.

Proof. Consider the least significant digit that differs in aa and bb. Then cc will have the same value of that digit as aa, which will be different from bb. Since this becomes the most significant digit in r(a),r(b),r(c)r(a), r(b), r(c), then of course bb cannot be between aa and cc.

To finish, we just need to show that if there are 8 numbers in arithmetic progression, which we'll write as a1,a1+d,a1+2d,,a1+7da_{1}, a_{1}+d, a_{1}+2d, \ldots, a_{1}+7d, three of them have the same number of digits. We have a few cases.

- If a1+3d<2ka1+4da_{1}+3d < 2^{k} \leq a_{1}+4d, then a1+4d,a1+5d,a1+6da_{1}+4d, a_{1}+5d, a_{1}+6d will have the same number of digits.

- If a1+4d<2ka1+5da_{1}+4d < 2^{k} \leq a_{1}+5d, then a1+5d,a1+6d,a1+7da_{1}+5d, a_{1}+6d, a_{1}+7d will have the same number of digits.

- If neither of these assumptions are true, a1+3d,a1+4d,a1+5da_{1}+3d, a_{1}+4d, a_{1}+5d will have the same number of digits.

Having exhausted all cases, we are done.

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.