On Zeckendorf Related Partitions Using the Lucas Sequence

Hung V. Chu, David C. Luo, Steven J. Miller

英文摘要：

Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such partitions need not be unique. In this paper, we prove that a natural number can have at most two distinct non-consecutive partitions in the Lucas sequence, find all positive integers with a fixed term in their partition, and calculate the limiting value of the proportion of natural numbers that are not uniquely partitioned into the sum of non-consecutive terms in the Lucas sequence.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Zeckendorf arithmetic for Lucas numbers

In this article we will be dedicated some algorithms of addition, subtraction, multiplication and division of two positive integers using Zeckendorf form. Such results find application in coding theory.

2015-01-18math.NT

关于Zeckendorf-Niven数与算术级数

On Zeckendorf-Niven numbers and arithmetic progressions

Dartmouth College（达特茅斯学院）；Williams College（威廉姆斯学院）；California State University, East Bay（加州州立大学东湾分校）；Texas A&M University（德克萨斯农工大学）；Kutztown University of Pennsylvania（宾夕法尼亚库茨敦大学）；Augustana University（奥古斯塔纳大学）

研究Zeckendorf-Niven数和Lucas-Niven数在算术级数中的分布，证明每个算术级数中存在无穷多个这样的数，并给出某些算术级数中连续项的最大数量界限。

2026-06-24math.NT

Difference in the Number of Summands in the Zeckendorf Partitions of Consecutive Integers

Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. We study the difference between the number of summands in the partition of two consecutive integers. In particular, let $L(n)$ be the number of summands in the partition of $n$. We characterize all positive integers such that $L(n) > L(n+1)$, $L(n) < L(n+1)$, and $L(n) = L(n+1)$. Furthermore, we call $n+1$ a peak of $L$ if $L(n) < L(n+1) > L(n+2)$ and a divot of $L$ if $L(n) > L(n+1) < L(n+2)$. We characterize all such peaks and divots of $L$.

2020-10-24math.NT

反向Zeckendorf博弈

The Reversed Zeckendorf Game

本文提出从Zeckendorf博弈终态开始、反转所有走法的反向Zeckendorf博弈，证明特定形式的n下玩家1有必胜策略，并求解了多种改进版该类博弈，为相关数论博弈研究提供了新方向。

2023-10-04math.COmath.NT

On sums of two Fibonacci numbers that are powers of numbers with limited Hamming weight

In 2018, Luca and Patel conjectured that the largest perfect power representable as the sum of two Fibonacci numbers is $3864^2 = F_{36} + F_{12}$. In other words, they conjectured that the equation \begin{equation}\tag{$\ast$}\label{eq:abstract} y^a = F_n + F_m \end{equation} has no solutions with $a\geq 2$ and $y^a > 3864^2$. While this is still an open problem, there exist several partial results. For example, recently Kebli, Kihel, Larone and Luca proved an explicit upper bound for $y^a$, which depends on the size of $y$. In this paper, we find an explicit upper bound for $y^a$, which only…

2023-02-16math.NT

斐波那契-富比尼数与卢卡斯-富比尼数

The Fibonacci-Fubini and Lucas-Fubini numbers

本文通过将有序贝尔数中的划分块按斐波那契方式排列，引入斐波那契-富比尼数，并研究其生成函数、显式公式、组合解释及算术三角形，同时揭示其与斯特林数的联系。

2024-07-05math.COmath.NT

更多相关论文收起更多论文

Partitions of primes by Chebyshev polynomials

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between the algebra of Chebyshev polynomials and number-theoretic properties of the partitions. It is shown how to obtain in this way some of the classical theory of Lucas sequences. A hidden symmetry of the problem is revealed by the new language. As an application number-theoretic properties of simple dynamical systems (rotations and certain interval maps) are disc…

2020-08-03math.NT

Partitions enumerated by self-similar sequences

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the tribonacci, Padovan, Pell, Narayana's cows, and Lucas sequences. For each sequence $a(n)$, however, we can define a related sequence $\textrm{sa}(n)$ by defining $\textrm{sa}(n)$ to have the same recurrence and initial conditions as $a(n)$, except that $\textrm{sa}(2n)=\textrm{sa}(n)$. Growth is no longer a problem: for each $n$ we construct recursively a set …

2023-03-20math.COmath.NT

On the number of $k$-compositions of $n$ satisfying certain coprimality conditions

We generalize the asymptotic estimates by Bubboloni, Luca and Spiga (2012) on the number of $k$-compositions of $n$ satisfying some coprimality conditions. We substantially refine the error term concerning the number of $k$-compositions of $n$ with pairwise relatively prime summands. We use a different approach, based on properties of multiplicative arithmetic functions of $k$ variables and on an asymptotic formula for the restricted partition function.

2021-05-28math.COmath.NT

Notes on Fibonacci Partitions

Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $Φ_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I deduce a formula for the function $Φ(n;t):=\sum_{h\geq 1}Φ_h(n)t^h$, and use it to analyze the functions $F(n):=Φ(n;1)$ and $χ(n):=Φ(n;-1)$. I obtain the least upper bound for $F(n)$ when $f_i-1\<n\<f_{i+1}-1$. It implies that $F(n)\<\sqrt{n+1}$ for any natural $n$. I prove also that $|χ(n)|\<1$, and $\mathop{\lim}\limits_{N\to\infty}\frac{1}{N} \left(χ^2(1)+χ^…

2018-05-12math.COmath.NT