Zeckendorf数位幂和的极值阶
Extremal orders of the Zeckendorf sum of digits of powers
摘要:
用s_F(n)表示将n写成斐波那契数之和所需的最小斐波那契数。对于任意h>= 2,我们得到了s_F(n^h)/s_F(n)的极值最小和极大序模.我们利用这一点来证明,对于所有$>N_0(h),存在一个n使得n是N个斐波那契数的和,而n^h是至多130个h^2斐波那契数的和。此外,我们还给出了s_F(n^h)/s_F(n)具有小值和大值的n的个数的上界和下界.这将Stolarsky的问题扩展到幂的Zeckendorf表示,并且它符合在斐波那契数及其有限和之间寻找完美幂的经典研究。
英文摘要:
Denote by s_F(n) the minimal number of Fibonacci numbers needed to write n as a sum of Fibonacci numbers. We obtain the extremal minimal and maximal orders of magnitude of s_F(n^h)/s_F(n) for any h>= 2. We use this to show that for all $>N_0(h) there is an n such that n is the sum of N Fibonacci numbers and n^h is the sum of at most 130 h^2 Fibonacci numbers. Moreover, we give upper and lower bounds on the number of n's with small and large values of s_F(n^h)/s_F(n). This extends a problem of Stolarsky to the Zeckendorf representation of powers, and it is in line with the classical investigation of finding perfect powers among the Fibonacci numbers and their finite sums.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。