MathDB
Similar to Beatty sequences

Source: Kürschak 2013, problem 1

July 6, 2014
number theory unsolvednumber theory

Problem Statement

Let a,ba,b be positive real numbers satisfying 2ab=ab2ab=a-b. Denote for any positive integer kk xkx_k and yky_k to be the closest integer to akak and bkbk, respectively (if there are two closest integers, choose the larger one). Prove that any positive integer nn appears in the sequence (xk)k1(x_k)_{k\ge 1} if and only if it appears at least three times in the sequence (yk)k1(y_k)_{k\ge 1}.