相关论文: On powers that are sums of consecutive like powers

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

Let $\mathcal{R}$ denote the set of integers $n$ that can be represented as the sum $n = x^2 + y^2$ with $(x,y) = 1$. Let $a$ and $b$ be integers with $a>0$, $a \nmid b$. We show that for sufficiently large positive integer $N$ there are…

By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…

In [1] it is shown that the Diophantine equation $(k!)^n+k^n=(n!)^k+n^k$ only has the trivial solution $n=k$, and $(k!)^n-k^n=(n!)^k-n^k$ only has the solutions $n=k$, $(n, k)=(1, 2),$ and $(2, 1)$. In this article we find all solutions of…

For $H \ge N^{1-\frac{1}{2c}} \ln^2 N$, where $c$ is a fixed non-integer number satisfying $$ \|c\| \ge 3c\left(2^{[c]+1}-1\right)\frac{\ln \ln N}{\ln N}, \qquad c > \frac{4}{3}\left(1 + \frac{52\ln \ln N}{\ln N}\right), $$ we obtain an…

The summation formula $$ \sum^{n-1}_{i=0}\epsilon^i i! (i^k+u_k) = v_k+\epsilon^{n-1} n! A_{k-1}(n) $$ $(\epsilon=\pm 1; k=1,2,...; u_k, v_k\in \msbm\hbox{Z}; A_{k-1}$ is a polynomial) is derived and its various aspects are considered. In…

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

In this paper, we consider the exponential Diophantine equation $a^{x}+b^{y}=c^{z},$ where $a, b, c$ be relatively prime positive integers such that $a^{2}+b^{2}=c^{r}, r\in Z^{+}, 2\mid r$ with $b$ even. That is $$a=\mid…

This work is devoted to proving that, given an integer $x \ge 2$, there are infinitely many perfect powers, coprime with $x$, having exactly $k \ge 3$ non-zero digits in their base $x$ representation, except for the case $x=2, k=4$, for…

For "almost all" sufficiently large $N,$ satisfying necessary congruence conditions and $k\geq 2$, we show that there is an {\bf asymptotic formula} for the number of solutions of the equation \begin{align*} \begin{split}…

We study purely exponential Diophantine equations with four terms of consecutive bases. Notably, we prove that all solutions to the equation \[ n^x=(n+1)^y+(n+2)^z+(n+3)^w \] in positive integers $n,x,y,z$ and $w$ are given by…

We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…

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…

In this paper, we consider the problem about finding out perfect powers in an alternating sum of consecutive cubes. More precisely, we completely solve the Diophantine equation $(x+1)^3 - (x+2)^3 + \cdots - (x + 2d)^3 + (x + 2d + 1)^3 =…

The Erd\"os-Moser conjecture states that the Diophantine equation $S_k(m) = m^k$, where $S_k(m)=1^k+2^k+...+(m-1)^k$, has no solution for positive integers $k$ and $m$ with $k \geq 2$. We show that stronger conjectures about consecutive…

This paper investigates the impossibility of certain $({n^2+n+k}_{n+1})$ configurations. Firstly, for $k=2$, the result of \cite{gropp1992non} that $\frac{n^2+n}{2}$ is even and $n+1$ is a perfect square or $\frac{n^2+n}{2}$ is odd and…

Let $1<c<d$ be two relatively prime integers, $g_{c,d}=cd-c-d$ and $\mathbb{P}$ is the set of primes. For any given integer $k \geq 1$, we prove that $$\#\left\{p^k\le g_{c,d}:p\in \mathbb{P}, ~p^k=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}…

In this paper, we use the modular method over totally real fields together with some standard conjectures (the Weak Frey--Mazur Conjecture and the Eichler--Shimura Conjecture) to prove that infinitely many equations of the type…

We show that the generalized Fermat equations with signatures (5,5,7), (5,5,19), and (7,7,5) (and unit coefficients) have no non-trivial primitive integer solutions. Assuming GRH, we also prove the nonexistence of non-trivial primitive…

We show a necessary and sufficient condition on the existence of finite order entire solutions of linear differential equations $$ f^{(n)}+a_{n-1}f^{(n-1)}+\cdots+a_1f'+a_0f=0,\eqno(+) $$ where $a_i$ are exponential sums for…