English
Related papers

Related papers: On Some Finite Sums with Factorials

200 papers

Summation of the $p$-adic functional series $\sum \varepsilon^n \, n! \, P_k^\varepsilon (n; x)\, x^n ,$ where $P_k^\varepsilon (n; x)$ is a polynomial in $x$ and $n$ with rational coefficients, and $\varepsilon = \pm 1$, is considered. The…

Number Theory · Mathematics 2017-02-10 Branko Dragovich

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…

Number Theory · Mathematics 2023-12-08 Parham Zarghami

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

Number Theory · Mathematics 2007-05-23 Moubariz Z. Garaev , Florian Luca , Igor E. Shparlinski

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

Combinatorics · Mathematics 2010-02-09 Jerome Kelleher

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. In this paper, we consider the Diophantine equation $u_m + u_n = a_1 n_1! + \cdots + a_k n_k!$ and prove that there are only finitely many…

Number Theory · Mathematics 2017-07-04 Sudhansu Sekhar Rout

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…

General Mathematics · Mathematics 2024-11-20 Eteri Samsonadze

The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…

History and Overview · Mathematics 2017-02-28 Tanay Wakhare

For any positive integers $m$ and $\alpha$, we prove that $$\sum_{k=0}^{n-1}\epsilon^k(2k+1)A_k^{(\alpha)}(x)^m\equiv0\pmod{n}, $$ where $\epsilon\in\{1,-1\}$ and $$…

Number Theory · Mathematics 2011-08-09 Hao Pan

The aim of this paper is to prove wordlessly the sum formula of $1^{k}+2^{k}+\ldots +n^{k}$, $k\in\{1,2,3\}$.

History and Overview · Mathematics 2022-06-16 Bikash Chakraborty

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

Classical Analysis and ODEs · Mathematics 2010-03-29 Markus Mueller , Dierk Schleicher

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

Number Theory · Mathematics 2012-04-10 Victor J. W. Guo , Jiang Zeng

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…

Number Theory · Mathematics 2023-05-04 Su Hu , Min-Soo Kim

We estimate character sums with n!, on average, and individually. These bounds are used to derive new results about various congruences modulo a prime p and obtain new information about the spacings between quadratic nonresidues modulo p.…

Number Theory · Mathematics 2007-05-23 Moubariz Z. Garaev , Florian Luca , Igor E. Shparlinski

Wolstenholme's type summations involve certain powers of all residues $k$ modulo some prime number $p$. We first consider the sums of double or triple products of certain powers of all residues, e.g., the sums of the terms $(a+k)^m(b+k)^n$…

Number Theory · Mathematics 2024-08-22 Zubeyir Cinkir

We prove effective finiteness results concerning polynomial values of the sums $$ b^k +\left(a+b\right)^k + \cdots + \left(a\left(x-1\right) + b\right)^k $$ and $$ b^k - \left(a+b\right)^k + \left(2a+b\right)^k - \ldots + (-1)^{x-1}…

Number Theory · Mathematics 2024-04-26 András Bazsó

Given an integer $n \ge 2$, its prime factorization is expressed as $n= \prod_{i=1}^s p_i^{a_i}$. We define the function $f(n)$ as the smallest positive integer such that $f(n)!$ is divisible by $n$. The main objective of this paper is to…

Number Theory · Mathematics 2026-03-05 Mihoub Bouderbala

In this paper we establish a new summation method by expanding $\prod_{k}(1-\frac{z}{a_{k}})^{-1}$ with two approaches: the Taylor expansion and the infinite partial fraction decomposition. Here we focus on the case when $a_{k}$ is…

Classical Analysis and ODEs · Mathematics 2021-02-09 Xiaowei Wang

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

Combinatorics · Mathematics 2014-02-25 Antal Balog , Oliver Roche-Newton

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

Combinatorics · Mathematics 2016-10-18 Jacob Sprittulla

In this note, we derive a finite summation formula and an infinite summation formula involving Harmonic numbers of order up to some order by means of several definite integrals

Number Theory · Mathematics 2021-12-01 Taekyun Kim , Dae San Kim , Hyunseok Kwon , Jongkyum Kwon
‹ Prev 1 2 3 10 Next ›