Related papers: On Ledin and Brousseau's summation problems

For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,\ldots,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for…

It is well known that every positive integer can be expressed as a sum of nonconsecutive Fibonacci numbers provided the Fibonacci numbers satisfy $F_n =F_{n-1}+F_{n-2}$ for $n\geq 3$, $F_1 =1$ and $F_2 =2$. In this paper, for any…

In a recent paper, Bilu et al. studied a conjecture of Marques and Lengyel on the $p$-adic valuation of the Tribonacci sequence. In this article, we study the $p$-adic valuation of third order linear recurrence sequences by considering a…

We study the equation $F_n + F_m = y^p$, where $F_n$ and $F_m$ are respectively the $n$-th and $m$-th Fibonacci numbers and $p \ge 2$. We find all solutions under the assumption $n \equiv m \pmod{2}$.

Let $\{G_n\}$ be a periodic sequence of integers modulo $m$ and let $\{SG_n\}$ be the partial sum sequence defined by $SG_n:= \sum_{k=0}^nG_k $ (mod $m$). We give a formula for the period of $\{SG_n\}$. We also show that for a generalized…

For a positive integer $n$ and a real number $\alpha$, the generalized Laguerre polynomials are defined by \begin{align*} L^{(\alpha)}_n(x)=\sum^n_{j=0}\frac{(n+\alpha)(n-1+\alpha)\cdots (j+1+\alpha)(-x)^j}{j!(n-j)!}. \end{align*} These…

We evaluate some new three parameter families of finite reciprocal sums involving Horadam numbers. We will also be able to state the results for the infinite sums. Some Fibonacci and Lucas sums will be presented as examples.

The sum-of-squares method can give rigorous lower bounds on the energy of quantum Hamiltonians. Unfortunately, typically using this method requires solving a semidefinite program, which can be computationally expensive. Further, the…

We derive weighted sums, including binomial and double binomial sums, for the generalized Fibonacci sequence $\{G_m\}$ where for $m\ge 2$, $G_m=G_{m-1}+G_{m-2}$ with initial values $G_0$ and $G_1$.

The binomial convolution of two sequences $\{a_n\}$ and $\{b_n\}$ is the sequence whose $n$th term is $\sum_{k=0}^{n} \binom{n}{k} a_k b_{n-k}$. If $\{a_n\}$ and $\{b_n\}$ have rational generating functions then so does their binomial…

The problem of representing a given positive integer as a sum of four squares of integers has been widely concerned for a long time, and for a given positive odd $n$ one can find a representation by doing arithmetic in a maximal order of…

The numbers $f_\lambda$ of standard tableaux of shape $\lambda\vdash n$ satisfy 2 fundamental recursions: $f_\lambda = \sum f_{\lambda^-}$ and $(n + 1)f_\lambda=\sum f_{\lambda^+}$, where $\lambda^-$ and $\lambda^+$ run over all shapes…

Let $q$ be a power of a prime, let $\mathbb{F}_q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := \{0, 1, \ldots, n\}$, we…

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

We define two notions of partial sums of a Riordan array, corresponding respectively to the partial sums of the rows and the partial sums of the columns of the Riordan array in question. We characterize the matrices that arise from these…

About four centuries ago, Johann Faulhaber developed formulas for the power sum $1^n + 2^n + \cdots + m^n$ in terms of $m(m+1)/2$. The resulting polynomials are called the Faulhaber polynomials. We first give a short survey of Faulhaber's…

Recently, Mneimneh proved the remarkable identity \begin{align*} \sum_{k=0}^n H_k\binom{n}{k} p^k(1-p)^{n-k}=\sum_{i=1}^n \frac{1-(1-p)^i}{i}\quad (p\in [0,1]) \end{align*} as the main result of a 2023 \emph{Discrete Mathematics} paper,…

Let $$ S_{m,n}(q):=\sum_{k=1}^{n}\frac{1-q^{2k}}{1-q^2} (\frac{1-q^k}{1-q})^{m-1}q^{\frac{m+1}{2}(n-k)}. $$ Generalizing the formulas of Warnaar and Schlosser, we prove that there exist polynomials $P_{m,k}(q)\in\mathbb{Z}[q]$ such that $$…

The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…