← All problems

The conjecture that continued-fraction sets with matched bounds cover modulo 1

1 year old · traced to

For k∈Nk\in\mathbb{N}, let F≤kF_{\leq k} and F≥kF_{\geq k} denote the continued-fraction sets whose partial quotients are respectively bounded above by kk and bounded below by kk. Write A+B={a+b:a∈A,b∈B}A+B=\{a+b:a\in A,b\in B\} and A≡Rmod  1A\equiv\mathbb{R}\mod 1 when A+Z=RA+\mathbb{Z}=\mathbb{R}. The continued-fraction upper-and-lower conjecture. For every k∈Nk\in\mathbb{N},

F≤2k+F≥k≡Rmod  1.F_{\leq 2k}+F_{\geq k}\equiv\mathbb{R}\mod 1.

The directly matched sum F≤k+F≥kF_{\leq k}+F_{\geq k} has diameter less than 11, so it cannot satisfy the corresponding covering statement. This alternative conjecture is presented as an analogue of the Lüroth-set results and relates to decompositions involving badly and well approximable numbers.

References
  1. Maiken Gravgaard and Ying Wai Lee, “Decomposition of real numbers into sums of Lüroth sets”, arXiv:2506.12513 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.