相关论文: Generalized Nested Summation of Powers of Natural …
Nested Sampling is a method for computing the Bayesian evidence, also called the marginal likelihood, which is the integral of the likelihood with respect to the prior. More generally, it is a numerical probabilistic quadrature rule. The…
Combining the derivative operator with Chu-Vandermonde convolution, we establish a class of summation formulas on generalized harmonic numbers.
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
We construct arithmetic terms representing the partial sums of binomial coefficients, and we extend these results to obtain arithmetic terms representing the multisections of binomial coefficient sums. We also introduce an arithmetic term…
We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…
Triangular map is a recent construct in probability theory that allows one to transform any source probability density function to any target density function. Based on triangular maps, we propose a general framework for high-dimensional…
Each natural number can be associated with some tree graph. Namely, a natural number $n$ can be factorized as $$ n = p_1^{\alpha_1}\ldots p_k^{\alpha_k},$$ where $p_i$ are distinct prime numbers. Since $\alpha_i$ are naturals, they can be…
Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…
Several combinatorial identities are presented, involving Stirling functions of the second kind with a complex variable. The identities involve also Stirling numbers of the first kind, binomial coefficients and harmonic numbers.
In this article a new method of generating sums of like powers is presented.
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\}$.
In this article we present a simple proof of Borevich-Shafarevich's method to compute the sum of the first n natural numbers of the same power. We also prove several properties of Bernoulli's numbers.
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…
We give an algorithm to compute the series expansion for the inverse of a given function. The algorithm is extremely easy to implement and gives the first $N$ terms of the series. We show several examples of its application in calculating…
A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…
We provide the analytic forms of the distributions for the sum of ordered spacings. We do this both for the case where the boundaries are included in the calculation of the spacings and the case where they are excluded. Both the probability…
We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…
A base-$g$ Niven number is a natural number divisible by the sum of its base-$g$ digits. We show that, for any $g\geq 3$, all sufficiently large natural numbers can be written as the sum of three base-$g$ Niven numbers. We also give an…
In this paper, we derive new model formulations for computing generalized singular values of a Grassman matrix pair. These new formulations make use of truncated filter matrices to locate the $i$-th generalized singular value of a Grassman…
Subresultant is a powerful tool for developing various algorithms in computer algebra. Subresultants for polynomials in standard basis (i.e., power basis) have been well studied so far. With the popularity of basis-preserving algorithms,…