olymmath

HMMT 2023 T6

  • Team

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(2023)= r(111111001112)=111001111112=1855r\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\left(a_{1}\right), \ldots, r(a8)r\left(a_{8}\right) is an arithmetic progression in that order.

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2023/t6 · Tag RPPAQAPPEA · Edit this page on GitHub · Keys: j next, k previous