Related papers: Some Diophantine equations and inequalities with p…

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

In this paper, we sharpen earlier work of the first author, Luca and Mulholland, showing that the Diophantine equation $$ A^3+B^3 = q^\alpha C^p, \, \, ABC \neq 0, \, \, \gcd (A,B) =1, $$ has, for "most" primes $q$ and suitably large prime…

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

In this paper we introduce a new diophantine equation with prime numbers. Let $[\, \cdot\,]$ be the floor function. We prove that when $1<c<\frac{23}{21}$ and $\theta>1$ is a fixed, then every sufficiently large positive integer $N$ can be…

We refine a recent result of Parsell on the values of the form $\lambda_1p_1 + \lambda_2p_2 + \mu_1 2^{m_1} + ...m + \mu_s 2^{m_s}, $ where $p_1,p_2$ are prime numbers, $m_1,...c, m_s$ are positive integers, $\lambda_1 / \lambda_2$ is…

In an earlier paper, Tatong and Suvarnamani explores the Diophantine equation $p^x + p^y = z^2$ for a prime number $p$. In that paper they find some solutions to the equation for $p=2, 3$. In this paper, we look at a general version of this…

Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like…

Let $F_n$ be the $n$-th Fibonacci number. In this paper, we study the Diophantine equation $F_n+F_m=p^xq^y$ in nonnegative integers $n\ge m$, $x$ and $y$, where $p$ and $q$ are fixed distinct prime numbers. We determine all pairs of primes…

Let $\mathfrak{p}=(\mathfrak{p}_1,...,\mathfrak{p}_r)$ be a system of $r$ polynomials with integer coefficients of degree $d$ in $n$ variables $\mathbf{x}=(x_1,...,x_n)$. For a given $r$-tuple of integers, say $\mathbf{s}$, a general local…

The sufficient conditions for insolvability of the Diophantine equation $\sum_{i=1}^{m}x_i^{n}=bc^{n}$ ($n, m \geq 2$, $b, c\in \mathbb{N}$) in nonnegative integers are obtained for the case where the canonical decomposition of the number…

We consider Diophantine quintuples $\{a, b, c, d, e\}$. These are sets of distinct positive integers, the product of any two elements of which is one less than a perfect square. It is conjectured that there are no Diophantine quintuples; we…

In this note, we find a new inequality involving primes and deduce several Bonse-type inequalities.

Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…

Let us denote by $F_n$ the $n$-th Fibonacci number. In this paper we show that for a fixed integer $y$ there exists at most one integer exponent $a>0$ such that the Diophantine equation $F_n+F_m=y^a$ has a solution $(n,m,a)$ in positive…

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

We obtain a first non-trivial estimate for the sum of dilates problem in the case of groups of prime order, by showing that if $t$ is an integer different from $0, 1$ or -1 and if $\A \subset \Zp$ is not too large (with respect to $p$),…

For two relatively prime positive integers $a, b\in \mathbb{N}$, it is known that exactly one of the two Diophantine equations $$ax + by \ =\ \frac{(a-1)(b-1)}{2}\ \mbox{ and }\ 1 + ax + by \ =\ \frac{(a-1)(b-1)}{2}$$ has a nonnegative…

In this paper we solve the ternary Piatetski-Shapiro inequality with prime numbers of a special form. More precisely we show that, for any fixed $1<c<\frac{427}{400}$, every sufficiently large positive number $N$ and a small constant…

Research on power values of power sums has gained much attention of late, partially due to the explosion of refinements in multiple advanced tools in (computational) Number Theory in recent years. In this survey, we present the key tools…

Denote by $s_0^{(r)}$ the least integer such that if $s \ge s_0^{(r)}$, and $F$ is a cubic form with real coefficients in $s$ variables that splits into $r$ parts, then $F$ takes arbitrarily small values at nonzero integral points. We bound…