2020arXiv (Cornell University)Open access

The weak converse of Zeckendorf's Theorem

Sungkon Chang

Open full text 0 citations

Abstract

By Zeckendorf's Theorem, every positive integer is uniquely written as a sum of non-adjacent terms of the Fibonacci sequence, and its converse states that if a sequence in the positive integers has this property, it must be the Fibonacci sequence. If we instead consider the problem of finding a monotone sequence with such a property, we call it the weak converse of Zeckendorf's theorem. In this paper, we first introduce a generalization of Zeckendorf conditions, and subsequently, Zeckendorf's theorems and their weak converses for the general Zeckendorf conditions. We also extend the generalization and results to the real numbers in the interval $(0,1)$, and to $p$-adic integers.

Open-access reader

About this research paper

What this paper is about

By Zeckendorf's Theorem, every positive integer is uniquely written as a sum of non-adjacent terms of the Fibonacci sequence, and its converse states that if a sequence in the positive integers has this property, it must be the Fibonacci sequence. If we instead consider the problem of finding a monotone sequence with such a property, we call it the weak converse of Zeckendorf's theorem. In this paper, we first introduce a generalization of Zeckendorf conditions, and subsequently, Zeckendorf's theorems and their weak converses for the general Zeckendorf conditions. We also extend the generalization and results to the real numbers in the interval $(0,1)$, and to $p$-adic integers.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

By Zeckendorf's Theorem, every positive integer is uniquely written as a sum of non-adjacent terms of the Fibonacci sequence, and its converse states that if a sequence in the positive integers has this property, it must be the Fibonacci sequence. If we instead consider the problem of finding a monotone sequence with such a property, we call it the weak converse of Zeckendorf's theorem. In this paper, we first introduce a generalization of Zeckendorf conditions, and subsequently, Zeckendorf's theorems and their weak converses for the general Zeckendorf conditions. We also extend the generalization and results to the real numbers in the interval $(0,1)$, and to $p$-adic integers.

Key concepts: Converse, Fibonacci number, Mathematics, Sequence (biology), Generalization, Combinatorics, Discrete mathematics, Interval (graph theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
The weak converse of Zeckendorf's Theorem — Research Paper | ScholarLens