Related papers: Deriving Closed-Form Expressions for Arithmetic Se…
In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…
Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…
The determinant of a lower Hessenberg matrix (Hessenbergian) is expressed as a sum of signed elementary products indexed by initial segments of nonnegative integers. A closed form alternative to the recurrence expression of Hessenbergians…
In this paper, we discuss a method that utilizes the recurrence of $A_{n,k}$ to solve summations of the form $\sum_{k=n_0}^{n} A_{n,k}$. It is observed that by repeating the procedure, the upper bound of summation is reduced and tilts…
Taking inspiration from the work of Lanphier \cite{LANPHIER2022125716}, a generalized multivariable polynomial formulation for sums of alternating powers is given, as well as analogous sums. Furthermore, an analog of the Euler-Maclaurin…
Summation formulae are classical tools in analysis: Taylor-MacLaurin, Euler-MacLaurin, Poisson, Vorono\"i, Circle formulae\ldots We will show how, from a single equation - referred to as the mother-equation - it is possible to unify these…
This paper sets the groundwork for the consideration of families of recursively defined polynomials and rational functions capable of describing the Bernoulli numbers. These families of functions arise from various recursive definitions of…
In this paper, we obtain some formulas for double nonlinear Euler sums involving harmonic numbers and alternating harmonic numbers. By using these formulas, we give new closed form sums of several quadratic Euler series through Riemann zeta…
Let $\{a_{1}, a_{2},\ldots, a_{n},\ldots\}$ be a sequence of complex numbers which has at most polynomial growth and satisfies an extra assumption. In this paper, inspired by a recent work of Sasane, we give an explanation of the sum…
In this paper we study sums of Dirichlet series whose coefficients are terms of the Thue-Morse sequence and variations thereof. We find closed-form expressions for such sums in terms of known constants and functions including the Riemann…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
We develop a systematic and fully explicit approach to the evaluation of binomial sums involving reciprocals of binomial coefficients based on Beta integral techniques. Starting from a simple integral representation, we provide a derivation…
We give explicit evaluations of the linear and non-linear Euler sums of hyperharmonic numbers $h_{n}^{\left( r\right) }$ with reciprocal binomial coefficients. These evaluations enable us to extend closed form formula of Euler sums of…
Using random variables as motivation, this paper presents an exposition of the formalisms developed by Rota and Taylor for the classical umbral calculus. A variety of examples are presented, culminating in several descriptions of sequences…
In this methodological paper, we first review the classic cubic Diophantine equation $a^3 + b^3 + c^3 = d^3$, and consider the specific class of solutions $q_1^3 + q_2^3 + q_3^3 = q_4^3$ with each $q_i$ being a binary quadratic form. Next…
In this work we deal with a symbolic approach to the general quadratic polynomial decomposition. By means of a symbolic implementation, we investigate some properties of the components sequences like orthogonality and symmetry. We present…
Powers of Fibonacci polynomials are expressed as single sums, improving on a double sum recently seen in the literature.
In the last ten years, the employment of symbolic methods has substantially extended both the theory and the applications of statistics and probability. This survey reviews the development of a symbolic technique arising from classical…
In this paper, we introduce a method of converting implicit equations to the usual forms of functions locally without differentiability. For a system of implicit equations which are equipped with continuous functions, if there are unique…
In the work we have considered p-adic functional series with binomial coefficients and discussed its p-adic convergence. Then we have derived a recurrence relation following with a summation formula which is invariant for rational argument.…