Related papers: On sums of triangular numbers

We examine what integers are representable as sums of three cubes. We also provide formulas for the number of representations of $x^3+y^3+z^3=n$ under the condition $x+y+z=t$. Also we show how the problem of three cubes is related to…

We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.

Inspired by the fact that the sum of the cubes of the first $n$ naturals is equal to the square of their sum, we explore, for each $n$, the Diophantine equation representing all non-trivial sets of $n$ integers with this property. We find…

While the general form of even perfect numbers is well-known, the existence or non-existence of odd perfect numbers is still an open problem. We address this problem and prove that if a natural number is odd, then it's not perfect.

As far as algebraic properties are concerned, the usual addition on the class of ordinal numbers is not really well behaved; for example, it is not commutative, nor left cancellative etc. In a few cases, the natural Hessemberg sum is a…

Let $\Bbb Z$ and $\Bbb N$ be the set of integers and the set of positive integers, respectively. For $a,b,c,d,n\in\Bbb N$ let $t(a,b,c,d;n)$ be the number of representations of $n$ by $ax(x-1)/2+by(y-1)/2+cz(z-1)/2 +dw(w-1)/2$…

Z.-W. Sun introduced three kinds of numbers: \begin{align*}S_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}(2k+1),\qquad s_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}\frac{1}{2k-1}, \end{align*} and $S_n^{+}=\sum_{k=0}^{n}{n\choose…

Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…

An integer of the form $P_8(x)=3x^2-2x$ for some integer $x$ is called a generalized octagonal number. A quaternary sum $\Phi_{a,b,c,d}(x,y,z,t)=aP_8(x)+bP_8(y)+cP_8(z)+dP_8(t)$ of generalized octagonal numbers is called {\it universal} if…

We prove some identities for the squares of generalized Tribonacci numbers. Various summation identities involving these numbers are derived.

In this paper, we investigate sums of four squares of integers whose prime factorizations are restricted, making progress towards a conjecture of Sun that states that two of the integers may be restricted to the forms $2^a3^b$ and $2^c5^d$.…

We compute the sum and the alternating sum of the reciprocals of triangular numbers using two standard methods from calculus: a telescoping series approach and a power series approach. We then extend these results to generalized…

In recent years, Z.-W. Sun proposed several sophisticated conjectures on congruences for finite sums with terms involving combinatorial sequences such as central trinomial coefficients, Domb numbers and Franel numbers. These sums are double…

For all positive non-square integer multiplier k, there is an infinity of multiples of triangular numbers which are also triangular numbers. With a simple change of variables, these triangular numbers can be found using solutions of Pell…

It is well-known that Lagrange's four-square theorem, stating that every natural number may be written as the sum of four squares, may be proved using methods from the classical theory of modular forms and theta functions. We revisit this…

By considering a limiting case of a Kronecker-type identity, we obtain an identity found by both Andrews and Crandall. We then use the Andrews-Crandall identity to give a new proof of a formula of Gauss for the representations of a number…

In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an…

In this paper, we prove two conjectures of Z.-W. Sun: $$2n\binom{2n}n\big|\sum_{k=0}^{n-1}(3k+1)\binom{2k}k^3{16}^{n-1-k}\ \mbox{for}\ \mbox{all}\ n=2,3,\cdots,$$ and $$\sum_{k=0}^{(p-1)/2}\frac{3k+1}{16^k}\binom{2k}{k}^3\equiv…

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…

Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…