Search arXivSearch

arXiv · 2504.20286

Integers Having $F_{2k}$ in Both Zeckendorf And Chung-Graham Decompositions

Abstract

Zeckendorf's theorem states that every positive integer can be uniquely decomposed into nonadjacent Fibonacci numbers. On the other hand, Chung and Graham proved that every positive integer can be uniquely written as a sum of even-indexed Fibonacci numbers with coefficients $0,1$, or $2$ such that between two coefficients $2$, there is a coefficient $0$. We discover a correspondence between a lexicographically ordered sublist of Zeckendorf decompositions and letters in the golden string $\mathcal{S}$. Likewise, we identify a dual correspondence for Chung-Graham decompositions. We then use these correspondences to give the set of all positive integers having $F_{2k}$ in both of their Zeckendorf and Chung-Graham decompositions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lucas Bustos, Hung Viet Chu, Minchae Kim, Uihyeon Lee, Shreya Shankar, Garrett Tresch. 2026-06-11. Integers Having $F_{2k}$ in Both Zeckendorf And Chung-Graham Decompositions. https://arxiv.org/abs/2504.20286

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT