Recently, Marko and Litvinov (ML) conjectured that, for all positive integers $n$ and $p$, the $p$-th power of $n$ admits the representation $n^p = \sum_{\ell =0}^{p-1} (-1)^{l} c_{p,\ell} F_{n}^{p-\ell}$, where $F_{n}^{p-\ell}$ is the $n$-th hyper-tetrahedron number of dimension $p-\ell$ and $c_{p,\ell}$ denotes the number of $(p -\ell)$-dimensional facets formed by cutting the $p$-dimensional cube $0 \leq x_1, x_2, \ldots, x_p \leq n-1$. In this paper we show that the ML conjecture is true for every natural number $p$. Our proof relies on the fact that the validity of the ML conjecture necessarily implies that $c_{p,\ell} = (p-\ell)! S(p, p-\ell)$, where $S(p,p-\ell)$ are the Stirling numbers of the second kind. Furthermore, we provide a number of equivalent formulas expressing the sum of powers $\sum_{i=1}^{n} i^p$ as a linear combination of figurate numbers.
We use representations and differentiation algorithms of posets, in order to obtain results concerning unsolved problems on figurate numbers. In particular, we present criteria for natural numbers which are the sum of three octahedral numbers, three polygonal numbers of positive rank or four cubes with two of them equal. Some identities of the Rogers-Ramanujan type involving this class of numbers are also obtained.
A conjecture of Cai-Zhang-Shen for figurate primes says that every integer $k>1$ is the sum of two figurate primes. In this paper we give an equivalent proposition to the conjecture. By considering extreme value problems with constraints about the conjecture in the cases of odd and even integers and using the method of Lagrange multipliers, Cardano formula for cubic equations and the contradiction, we prove the conjecture.
In this article, we consider the problem of determining formulas for the number of representations of a natural number $n$ by a sum of figurate numbers with certain positive integer coefficients. To achieve this, we prove that the associated generating function gives rise to a modular form of integral weight under certain condition on the coefficients when even number of higher figurate numbers are considered. In particular, we obtain modular property of the generating function corresponding to a sum of even number of triangular numbers with coefficients. We also obtain modularity property of …
We show that the eighth power of the Jacobi triple product is a Jacobi--Eisenstein series of weight $4$ and index $4$ and we calculate its Fourier coefficients. As applications we obtain explicit formulas for the eighth powers of theta-constants of arbitrary order and the Fourier coefficients of the Ramanujan Delta-function $Δ(τ)=η^{24}(τ)$, $η^{12}(τ)$ and $η^{8}(τ)$ in terms of Cohen's numbers $H(3,N)$ and $H(5,N)$. We give new formulas for the number of representations of integers as sums of eight higher figurate numbers. We also calculate the sixteenth and the twenty-fourth powers of the J…
In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.
In this paper we construct $q$-Genocchi numbers and polynomials. By using these numbers and polynomials, we investigate the $q$-analogue of alternating sums of powers of consecutive integers due to Euler.
We study the problem of representing integers as sums of prime numbers from a fixed Beatty sequence $B_{α,β}$, where $α>1$ is irrational and of finite type.
It is well known that the harmonic sum $H_n(1)=\sum_{k=1}^n\frac{1}{k}$ is never an integer for $n>1$. In 1946, Erdős and Niven proved that the nested multiple harmonic sum $H_n(\{1\}^r)=\sum_{1\le k_1<\dots<k_r\le n}\frac{1}{k_1\cdots k_r}$ can take integer values only for a finite number of positive integers $n$. In 2012, Chen and Tang refined this result by showing that $H_n(\{1\}^r)$ is an integer only for $(n,r)=(1,1)$ and $(n,r)=(3,2)$. In this paper, we consider the integrality problem for arbitrary multiple harmonic and multiple harmonic star sums and show that none of these sums is an…
In this paper we construct a new q-Euler numbers and polynomials. By using these numbers and polynomials, we give the interesting formulae related to alternating sums of powers of consecutive q-integers following an idea due to Euler.
We combine an extended version of Bailey's transform with an identity of Bressoud and with some identities of Berkovich and Warnaar to prove a variety of positivity results for alternating sums involving partition functions.
In this paper we construct the $q$-analogue of Barnes's Bernoulli numbers and polynomials of degree 2, for positive even integers, which is an answer to a part of Schlosser's question. For positive odd integers, Schlosser's question is still open. Finally, we will treat the $q$-analogue of the sums of powers of consecutive integers.
We give a characterization of all pairs $(k,n)$ of positive integers for which the ratio $$ \frac{1^k-2^k+3^k-\dots+(-1)^{n+1} n^k}{1^k-2^k+3^k-\dots+(-1)^{n}(n-1)^k} $$ of two consecutive alternating power sums is an integer.
We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.
In this paper, we prove a conjecture of Chan and Chua for the number of representations of integers as sums of 8s integral squares. The proof uses a theorem of Imamoglu and Kohnen, and the double shuffle relations satisfied by the double Eisenstein series of level 2.
In this note, we show the existence of integer sequences of lengths at least 3 (except 7) such that for every integer in position $i\equiv 1\pmod{4}$ (respectively position $j\equiv 3\pmod{4}$), counting from left to right, the sum of the integer and the adjacent integer(s) has a constant sum $x$ (respectively $y$) with $x\ne y$.
Suppose a positive integer $n$ is written as a sum of squares of $m$ integers. What can one say about the value $T$ of the sum of these $m$ integers itself? Which $T$ can be obtained if one considers all possible representations of $n$ as a sum of squares of $m$ integers? Denoting this set of all possible $T$ by $\mathscr{S}_m(n)$, Goldmakher and Pollack have given a simple characterization of $\mathscr{S}_4(n)$ using elementary arguments. Their result can be reinterpreted in terms of Mordell's theory of representations of binary integral quadratic forms as sums of squares of integral linear f…
In this paper we construct the q-analogue of Barnes' Bernoulli numbers and plynomials of degree 2, which is an answer to a part of Schlosser's question. Finally, we treat the q-analogue of the sums of powers of consecutive integrs.
In this note we consider the theorem established in arXiv:1912.07171 concerning the sums of powers of the first $n$ positive integers, $S_k = 1^k + 2^k + \cdots + n^k$, and show that it can be used to demonstrate the classical theorem of Faulhaber for both cases of odd and even $k$.
We prove that the greatest positive integer that is not expressible as a linear combination with integer coefficients of elements of the set $\{n^2,(n+1)^2,\ldots \}$ is asymptotically $O(n^2)$, verifying thus a conjecture of Dutch and Rickett. Furthermore we ask a question on the representation of integers as sum of four large squares.
In this paper, we show that certain sums of generalized $m$-gonal numbers represent every positive integer if and only if they represent every positive integer up to an explicit bound $C_m$, verifying a conjecture of Sun for sufficiently large positive integers.
For coprime positive integers $q$ and $e$, let $m(q,e)$ denote the least positive integer $t$ such that there exists a sum of $t$ powers of $q$ which is divisible by $e$. We prove an upper bound for $m(q.e)$ and investigate the case where $m(q,e)$ is "large". We also pay special attention to the situation where $e$ is a prime power.
We study sums of arithmetic functions, defined on Gaussian integers and taken over those pairs of integers whose coordinates give rise to a singular system.
We use elementary arguments to prove results on the order of magnitude of certain sums concerning the gcd's and lcm's of $k$ positive integers, where $k\ge 2$ is fixed. We refine and generalize an asymptotic formula of Bordellès (2007), and extend certain related results of Hilberdink and Tóth (2016). We also formulate some conjectures and open problems.
We say a positive integer is a sum of three nonunit squares if it is a sum of three squares of integers other than one. In this article, we find all integers which are sums of three nonunit squares assuming that the Generalized Riemann Hypothesis(GRH) holds. As applications, we find all integers, under the GRH only when $k=3$, which are sums of $k$ nonzero triangular numbers, sums of $k$ nonzero generalized pentagonal numbers, and sums of $k$ nonzero generalized octagonal numbers, respectively for any integer $k\ge 3$.
In totally real number fields, we characterize the rings of $S$-integers (obtained by inverting a rational integer $m$) such that all their totally positive elements are represented as a sum of squares. We further obtain partial answers to the question: when are all the totally positive algebraic integers that are divisible by $m$ represented as a sum of squares?
In this paper, we derive a formula for the sums of powers of the first $n$ positive integers, $S_k(n)$, that involves the hyperharmonic numbers and the Stirling numbers of the second kind. Then, using an explicit representation for the hyperharmonic numbers, we generalize this formula to the sums of powers of an arbitrary arithmetic progression. Moreover, we express the Bernoulli polynomials in terms of hyperharmonic polynomials and Stirling numbers of the second kind. Finally, we extend the obtained formula for $S_k(n)$ to negative values of $n$.
We show that Euler's relation and the Taxi-Cab relation are both solutions of the same equation. General solutions of sums of two consecutive cubes equaling the sum of two other cubes are calculated. There is an infinite number of relations to be found among the sums of two consecutive cubes and the sum of two other cubes, in the form of two families. Their recursive and parametric equations are calculated.
We prove that $164634913$ is the smallest positive integer that is a sum of two rational sixth powers but not a sum of two integer sixth powers. If $C_{k}$ is the curve $x^{6} + y^{6} = k$, we use the existence of morphisms from $C_{k}$ to elliptic curves, together with the Mordell-Weil sieve, to rule out the existence of rational points on $C_{k}$ for various $k$.
We employ the spectral theory of Eisenstein series to prove that the Hardy sums, integer-valued analogs of the classical Dedekind sums, are uniformly distributed in $\mathbf{Z} / m \mathbf{Z}$ for any integer $m > 1$.
Considering the problem of finding all the integer solutions of the sum of $M$ consecutive integer squares starting at $a^{2}$ being equal to a squared integer $s^{2}$, it is shown that this problem has no solutions if $M\equiv3,5,6,7,8$ or $10 (mod\,12)$ and has integer solutions if $M\equiv0,9,24$ or $33 (mod\,72)$; or $M\equiv1,2$ or $16 (mod\,24)$; or $M\equiv11 (mod\,12)$. All the allowed values of $M$ are characterized using necessary conditions. If $M$ is a square itself, then $M\equiv1 (mod\,24)$ and $(M-1)/24$ are all pentagonal numbers, except the first two.
We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann Hypothesis, then we can improve the exponent $1/k$: There are examples such that the partial sums up to $x$ are $o(x^{1/(k+\frac{1}{2})+ε})$, for all $ε>0$. This generalizes to the $k$-free integers the results of Aymone, `` A note on multiplicative functions resembling the {M}öbius function'', J. Number Theory, 212 (2020), pp. 113--121.
All integer solutions $\left(M,a,c\right)$ to the problem of the sums of $M$ consecutive cubed integers $\left(a+i\right)^{3}$ ($a>1$, $0\leq i\leq M-1$) equaling squared integers $c^{2}$ are found by decomposing the product of the difference and sum of the triangular numbers of $\left(a+M-1\right)$ and $\left(a-1\right)$ in the product of their greatest common divisor $g$ and remaining square factors $δ^{2}$ and $σ^{2}$, yielding $c=gδσ$. Further, the condition that $g$ must be integer for several particular and general cases yield generalized Pell equations whose solutions allow to find all …
We study three special Dirichlet series, two of them alternating, related to the Riemann zeta function. These series are shown to have extensions to the entire complex plane and we find their values at the negative integers (or residues at poles). These values are given in terms of Bernoulli and Euler numbers.
A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of the Faà di Bruno's formula. These sums of products are analogous to the higher order Bernoulli numbers and are used to develop the closed form expressions for the sums of products involving the power sums $\displaystyle Ψ_k(x,n):=\sum_{d|n}μ(d)d^k S_k(\frac{x}{d}), n\in\mathbb{Z}^+$ which are defined via the Möbius function $μ$ and the usual power sum $S_k(x)$ of a real or complex varia…
Arithmetic progressions of integers that are relatively prime to their digital sums
The College of Idaho（爱达荷学院）；Cedar Crest College（雪松crest学院）；Bryn Mawr College（布林茅尔学院）；University of Michigan（密歇根大学）；Kutztown University of Pennsylvania（宾夕法尼亚库兹敦大学）
In this paper, we consider representations of integers as sums of generalized heptagonal numbers with a prescribed number of repeats of each heptagonal number appearing in the sum. In particular, we investigate the classification of such sums which are universal, i.e., those that represent every positive integer. We prove an explicit finite bound such that a given sum is universal if and only if it represents positive integer up to the given bound.
Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by $u_1^{j/k} + u_2^{j/k} + ... + u_l^{j/k}$, $u_i \in \mathbb{Z}^+$, the number of values less than or equal to a given $w>0$ is determined. The counting functions developed are framed in terms of convolution exponentials, and are closely related to the Riemann zeta function. At the conclusion, several estimates are derived, with special emphasis on the case of sums of square roots, i.e. $j=1$, $k=2$.
For each integer $x$, the $x$-th generalized pentagonal number is denoted by $P_5(x)=(3x^2-x)/2$. Given odd positive integers $a,b,c$ and non-negative integers $r,s$, we employ the theory of ternary quadratic forms to determine when the sum $aP_5(x)+2^rbP_5(y)+2^scP_5(z)$ represents all but finitely many positive integers.
We estimate Weyl sums over the integers with sum of binary digits either fixed or restricted by some congruence condition. In our proofs we use ideas that go back to a paper by Banks, Conflitti and the first author (2002). Moreover, we apply the "main conjecture" on the Vinogradov mean value theorem which has been established by Bourgain, Demeter and Guth (2016) as well as by Wooley (2016, 2019). We use our result to give an estimate of the discrepancy of point sets that are defined by the values of polynomials at arguments having the sum of binary digits restricted in different ways.
