arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.16756math.NT
收藏

平方和:恒等式族的证明方法

Sums of Squares: Methods for Proving Identity Families

Russell Jay Hendel

摘要:

本文提出了一种方法和结果。结果给出了序列$F^{(k)}$的前$m+1,m \ge 0,$平方和的封闭公式,其中每个成员是前一个$k$成员的和,初始条件为$k-1$ 0后跟1。推广的结果包括已知的结果总和平方的斐波那契数和最近的结果Schumaker的总和平方的Tribonacci数。为了统一证明所有$k,$的身份的代数验证方法,它减少了身份的证明,以验证的平等的许多对有限次多项式,可能在几个变量。其他几个文件证明家庭的身份进行检查,并建议,收集统一的证明方法,在这些文件中使用的可能会产生一个新的趋势,说明和证明身份。

英文摘要:

This paper presents both a method and a result. The result presents a closed formula for the sum of the first $m+1,m \ge 0,$ squares of the sequence $F^{(k)}$ where each member is the sum of the previous $k$ members and with initial conditions of $k-1$ zeroes followed by a 1. The generalized result includes the known result of sums of squares of the Fibonacci numbers and a recent result of Schumaker on sums of squares of Tribonacci numbers. To prove the identities uniformly for all $k,$ the Algebraic Verification method is presented which reduces proof of an identity to verification of the equality of finitely many pairs of finite-degree polynomials, possibly in several variables. Several other papers proving families of identities are examined, and it is suggested that the collection of the uniform proof methods used in these papers could produce a new trend in stating and proving identities.

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

↑