关于Ledin和Brousseau求和问题
On Ledin and Brousseau's summation problems
摘要:
我们开发了一个递归的计划,以及多项式形式(多项式在$n$的程度$m$),用于评估的形式$S(m,n,r)=\sum_{k=1}^nk^mF_{k + r}$,$T(m,n,r)=\sum_{k=1}^nk^mL_{k + r}$非负整数$m$和$n$和任意整数$r$的Ledin和Brousseau的斐波那契和; $F_j$和$L_j$是$j^{th}$斐波那契和卢卡斯数。我们还扩展到一般的二阶序列的研究,通过建立一个递归的程序来确定$W(m,n,r;a,b,p,q)=\sum_{k=1}^nk^mw_{k+r}$,其中$(w_j(a,b;p,q))$是由$w_0 = a,\,w_1 = b;\,w_j = pw_{j - 1} - qw_{j - 2}\, (j \ge 2);$定义的Horadam序列,其中$a$,$b$,$p$和$q$是任意复数,与$p\ne 0$和$q\ne 0$。建立了$W(m,n,r;a,b,1,q)$的显式多项式形式,更一般地,建立了$\mathcal W(m,n,h,r;a,b,p,q) = \sum_{k = 1}^n {V_h^{- k}k^m w_{hk + r}}$和的显式多项式形式,其中$(V_j(p,q))=(w_j(2,p;p,q))$。最后,建立了一个多项式形式的Ledin-Brousseau和涉及Horadam数与下标的等差数列。
英文摘要:
We develop a recursive scheme, as well as polynomial forms (polynomials in $n$ of degree $m$), for the evaluation of Ledin and Brousseau's Fibonacci sums of the form $S(m,n,r)=\sum_{k=1}^nk^mF_{k + r}$, $T(m,n,r)=\sum_{k=1}^nk^mL_{k + r}$ for non-negative integers $m$ and $n$ and arbitrary integer $r$; $F_j$ and $L_j$ being the $j^{th}$ Fibonacci and Lucas numbers. We also extend the study to a general second order sequence by establishing a recursive procedure to determine $W(m,n,r;a,b,p,q)=\sum_{k=1}^nk^mw_{k+r}$ where $(w_j(a,b;p,q))$ is the Horadam sequence defined by $w_0 = a,\,w_1 = b;\,w_j = pw_{j - 1} - qw_{j - 2}\, (j \ge 2);$ where $a$, $b$, $p$ and $q$ are arbitrary complex numbers, with $p\ne 0$ and $q\ne 0$. An explicit polynomial form for $W(m,n,r;a,b,1,q)$ and more generally for the sum $\mathcal W(m,n,h,r;a,b,p,q) = \sum_{k = 1}^n {V_h^{- k}k^m w_{hk + r}}$, where $(V_j(p,q))=(w_j(2,p;p,q))$, is established. Finally a polynomial form is established for a Ledin-Brousseau sum involving Horadam numbers with subscripts in arithmetic progression.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。