Related papers: Primes Solutions Of Linear Diophantine Equations

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…

\noindent In this article, we determine all the integers $c$ having at least two representations as difference between two linear recurrent sequences. This is a variant of the Pillai's equation. This equation is an exponential Diophantine…

The main aim of this article is to find all solutions of the Diophantine equation $x^2 + p^k=y^n$ where $p \equiv 1 \pmod 4$, $\frac{p-1}{3}$ is a perfect square and the class number of $\mathbb{Z}[\sqrt{-p}]$ is $2$. In this article, I…

Diophantine equations are multivariate equations, usually polynomial, in which only integer solutions are admitted. A brute force method for finding solutions would be to systematically substitute possible integer solutions and check for…

In this paper, we prove a theorem about the integer solutions to the Diophantine equation $x^{4}-q^{4}=py^{r}$, extending previous work of K.Gy\H ory, and F.Luca and A.Togbe, and of the author.

Let A(n) be a $k\times s$ matrix and $m(n)$ be a $k$ dimensional vector, where all entries of A(n) and $m(n)$ are integer-valued polynomials in $n$. Suppose that $$t(m(n)|A(n))=#\{x\in\mathbb{Z}_{+}^{s}\mid A(n)x=m(n)\}$$ is finite for each…

For every positive integer $n$, an infinite family of positive integral solutions of the diophantine equation $x^n - y^n = z^{n+1}$ is constructed.

A sequence of integers of the form $\lfloor n^{\alpha}\rfloor$ $(n=1,2,\ldots)$ for some fixed non-integral $\alpha>1$ is called a Piatetski-Shapiro sequence, where $\lfloor x\rfloor$ denotes the integer part of $x$. Let…

Let $\{ {U_{n}\}_{n \geq 0} }$ be a non-degenerate binary recurrence sequence with positive discriminant. Let $\{p_1,\ldots, p_s\}$ be fixed prime numbers and $\{b_1,\ldots ,b_s\}$ be fixed non-negative integers. In this paper, we obtain…

In this note, we find all the solutions of the Diophantine equation x^2 +2^a.3^b.11^c=y^n in nonnegative integers a, b, c, x, y, n>= 3 with x and y coprime.

For relatively prime integers $a$ and $b$ both greater than one and odd integer $c$, there are at most two solutions in positive integers $(x,y,z)$ to the equation $a^x + b^y = c^z$. There are an infinite number of $(a,b,c)$ giving exactly…

Let $\varepsilon>0$ be a small constant. In the present paper we prove that whenever $\eta$ is real and constants $\lambda _i$ satisfy some necessary conditions, then there exist infinitely many prime triples $p_1,\, p_2,\, p_3$ satisfying…

Given an integer $m \geq 2$ and a sufficiently large $q$, we apply a variant of the Maynard--Tao sieve weight to establish the existence of an arithmetic progression with common difference $q$ for which the $m$-th least prime in such…

In this paper, elliptic curves theory is used for solving the Diophantine equations X^3+Y^3+Z^3+aU^k=a_0U_0^{t_0}+...+a_nU_n^{t_n}, k=3,4 where n, ti are natural numbers and a, a_i are fixed arbitrary rational numbers. We try to transform…

In this paper we consider Diophantine equations of the form $f(x)=g(y)$ where $f$ has simple rational roots and $g$ has rational coefficients. We give strict conditions for the cases where the equation has infinitely many solutions in…

In this paper we generalize the result of Fouvry and Iwaniec dealing with prime values of the quadratic form $x^2 + y^2$ with one input restricted to a thin subset of the integers. We prove the same result with an arbitrary primitive…

The Diophantine equation 4/n=1/x+1/y+1/z for a Pythagorean prime n is split into two independent Diophantine equations, which correspond to two different types of solution. The solvability of these equations forces certain restrictions on…

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…

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. For a positive integer n, let f(n) denote the greatest finite total number of solutions of a subsystem of E_n in integers x_1,...,x_n. We prove: (1) the function f is…