相关论文: On sums of four pentagonal numbers with coefficien…
Lagrange's four squares theorem is a classical theorem in number theory. Recently, Z.-W. Sun found that it can be further refined in various ways. In this paper we study some conjectures of Sun and obtain various refinements of Lagrange's…
Generalized $m$-gonal numbers are those $p_m(x)= [ (m - 2)x^2 - (m - 4)x ]/2 $ where $x$ and $m$ are integers with $m \geq 3$. If any nonnegative integer can be written in the form $ap_r(h)+bp_s(l)+cp_t(m)+dp_u(n)$, where $a,b,c,d$ are…
Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p\ge 5$ and $r\ge 2$, we prove that \begin{equation} \sum\limits_{\begin{smallmatrix}…
An integer of the form $p_m(x)= \frac{(m-2)x^2-(m-4)x}{2} \ (m\ge 3)$, for some integer $x$ is called a generalized polygonal number of order $m$. A ternary sum $\Phi_{i,j,k}^{a,b,c}(x,y,z)=ap_{i+2}(x)+bp_{j+2}(y)+cp_{k+2}(z)$ of…
For all nonnegative integers n, the Franel numbers are defined as $$ f_n=\sum_{k=0}^n {n\choose k}^3.$$ We confirm two conjectures of Z.-W. Sun on congruences for Franel numbers: \sum_{k=0}^{n-1}(3k+2)(-1)^k f_k &\equiv 0 \pmod{2n^2},…
An integer-valued polynomial $P(x,y,z)$ is said to be universal (over $\mathbb Z$) if each nonnegative integer can be written as $P(x,y,z)$ with $x,y,z\in\mathbb Z$. In this paper, we mainly introduce a new technique to determine the…
Lagrange's four-square theorem asserts that any $n\in\mathbb N=\{0,1,2,\ldots\}$ can be written as the sum of four squares. This can be further refined in various ways. We show that any $n\in\mathbb N$ can be written as $x^2+y^2+z^2+w^2$…
We prove a conjecture posted in the Online Encyclopedia of Integer Sequences, namely that there are exactly five positive integers that can be written in more than one way as the sum of a nonnegative power of 2 and a nonnegative power of 3.…
For each integer $m\ge3$, let $P_m(x)$ denote the generalized $m$-gonal number $\frac{(m-2)x^2-(m-4)x}{2}$ with $x\in\mathbb{Z}$. Given positive integers $a,b,c,k$ and an odd prime number $p$ with $p\nmid c$, we employ the theory of ternary…
Let $p$ be a prime. We define $S(p)$ the smallest number $k$ such that every positive integer is a sum of at most $k$ squares of integers that are not divisible by $p$. In this article, we prove that $S(2)=10$, $S(3)=6$, $S(5)=5$, and…
The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…
A Pythagorean n-tuple is an integer solution of x_1^2+...+x_{n-1}^2=x_n^2. For n=4 and n=6, the Pythagorean n-tuples admit a parametrization by a single n-tuple of polynomials with integer coefficients (which is impossible for n=3). For…
Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…
Translation from the Latin of Euler's "Observatio de summis divisorum" (1752). E243 in the Enestroem index. The pentagonal number theorem is that $\prod_{n=1}^\infty (1-x^n)=\sum_{n=-\infty}^\infty (-1)^n x^{n(3n-1)/2}$. This paper assumes…
In this paper we confirm a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p=2m+1 is a prime congruent to 3 modulo 4 if and…
Eberhard proved that for every sequence $(p_k), 3\le k\le r, k\ne 5,7$ of non-negative integers satisfying Euler's formula $\sum_{k\ge3} (6-k) p_k = 12$, there are infinitely many values $p_6$ such that there exists a simple convex…
Let $ \{P_{n}\}_{n\geq 0} $ be the sequence of Padovan numbers defined by $ P_0=0 $, $ P_1 =1=P_2$ and $ P_{n+3}= P_{n+1} +P_n$ for all $ n\geq 0 $. In this paper, we find all repdigits in base $ 10 $ which can be written as a sum of three…
In this paper Euler considers the properties of the pentagonal numbers, those numbers of the form $\frac{3n^2 \pm n}{2}$. He recalls that the infinite product $(1-x)(1-x^2)(1-x^3)...$ expands into an infinite series with exponents the…
Let $ (P_{n})_{n\ge 0} $ be the sequence of Padovan numbers defined by $ P_0=0 $, $ P_1 =1=P_2$, and $ P_{n+3}= P_{n+1} +P_n$ for all $ n\ge 0 $. In this paper, we find all Padovan numbers that are concatenations of two distinct repdigits.
In this paper we establish some new congruences involving central binomial coefficients as well as Catalan numbers. Let $p$ be a prime and let $a$ be any positive integer. We determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}$ mod $p^2$ for…