Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userProof Without Words: Sums of Powers of Natural numbers
75
0
0.0
(
0
)
Authors
Bikash Chakraborty
Ask ChatGPT about the research
No Arabic abstract
The aim of this paper is to prove wordlessly the sum formula of $1^{k}+2^{k}+ldots +n^{k}$, $kin{1,2,3}$.
rate research
Read More
In this note, we extend the definition of multiple harmonic sums and apply their stuffle relations to obtain explicit evaluations of the sums $R_n(p,t)=sum olimits_{m=0}^n m^p H_m^t$, where $H_m$ are harmonic numbers. When $tle 4$ these sums were first studied by Spiess around 1990 and, more recently, by Jin and Sun. Our key step first is to find an explicit formula of a special type of the extended multiple harmonic sums. This also enables us to provide a general structural result of the sums $R_n(p,t)$ for all $tge 0$.
We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.
In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The so-called binomial sums are also considered. The problem of constructing polynomials that allow to calculate the values of the corresponding sums in certain cases is solved.
In this paper we study sums of powers of affine functions in (mostly) one variable. Although quite simple, this model is a generalization of two well-studied models: Waring decomposition and sparsest shift. For these three models there are natural extensions to several variables, but this paper is mostly focused on univariate polynomials. We present structural results which compare the expressive power of the three models; and we propose algorithms that find the smallest decomposition of f in the first model (sums of affine powers) for an input polynomial f given in dense representation. We also begin a study of the multivariate case. This work could be extended in several directions. In particular, just as for Sparsest Shift and Waring decomposition, one could consider extensions to supersparse polynomials and attempt a fuller study of the multi-variate case. We also point out that the basic univariate problem studied in the present paper is far from completely solved: our algorithms all rely on some assumptions for the exponents in an optimal decomposition, and some algorithms also rely on a distinctness assumption for the shifts. It would be very interesting to weaken these assumptions, or even to remove them entirely. Another related and poorly understood issue is that of the bit size of the constants appearing in an optimal decomposition: is it always polynomially related to the bit size of the input polynomial given in dense representation?
In the past two decades, many researchers have studied {it index $2$} Gauss sums, where the group generated by the characteristic $p$ of the underling finite field is of index $2$ in the unit group of ${mathbb Z}/m{mathbb Z}$ for the order $m$ of the multiplicative character involved. A complete solution to the problem of evaluating index $2$ Gauss sums was given by Yang and Xia~(2010). In particular, it is known that some nonzero integral powers of the Gauss sums in this case are in quadratic fields. On the other hand, Chowla~(1962), McEliece~(1974), Evans~(1977, 1981) and Aoki~(1997, 2004, 2012) studied {it pure} Gauss sums, some nonzero integral powers of which are in the field of rational numbers. In this paper, we study Gauss sums, some integral powers of which are in quadratic fields. This class of Gauss sums is a generalization of index $2$ Gauss sums and an extension of pure Gauss sums to quadratic fields.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
