Related papers: Diophantine equations in primes: density of prime …

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive, square-free discriminant and $p$ be a fixed prime number. In this paper, we have shown the finiteness result for the solutions of the Diophantine…

For any positive integer $n$, let $f(n)$ denote the number of solutions to the Diophantine equation $\frac{4}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$ with $x,y,z$ positive integers. The \emph{Erd\H{o}s-Straus conjecture} asserts that…

This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ \theta ,$ where $ \theta >2$ is real and non-integral. For fixed non-zero real numbers $ \lambda_i $ not all of the same sign we write…

The aim of this note is to show that given a positive integer $n \geq 5$, the positive integral solutions of the diophantine equation $4/n = 1/x + 1/y+1/z$ cannot have solution such that $x$ and $y$ are coprime with $xy < \sqrt{z/2}$. The…

The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for…

The title equation, where $p>3$ is a prime number $\not\equiv 7 \pmod 8$, $q$ is an odd prime number and $x,y,n$ are positive integers with $x,y$ relatively prime, is studied. When $p\equiv 3\pmod 8$, we prove (Theorem 2.3) that there are…

Let $a$ and $b$ be two distinct fixed positive integers such that $\min \{a,b\}>1.$ First, we correct an oversight from \cite{X-Z}. Then, we show that the equation in the title with $b \equiv 3 \pmod 8$, $b$ prime and $a$ even has no…

In this article we establish two new results on quantitative Diophantine approximation for one-parameter families of diagonal ternary indefinite forms. In the first result, we consider quadratic forms taking values at prime points. In the…

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…

In the present work, we discuss the existence of a unique positive solution of a boundary value problem for nonlinear fractional order equation with singularity. Precisely, order of equation $D_{0+}^\alpha u(t)=f(t,u(t))$ belongs to $(3,4]$…

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}}. If Matiyasevich's conjecture on finite-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

We prove a prime geodesic theorem for compact quotients of affine buildings and apply it to get class number asymptotics for global fields of positive characteristic.

Assume a polynomial-time algorithm for factoring integers, Conjecture~\ref{conj}, $d\geq 3,$ and $q$ and $p$ are prime numbers, where $p\leq q^A$ for some $A>0$. We develop a polynomial-time algorithm in $\log(q)$ that lifts every…

We study the problem of Diophantine approximation on lines in R^2 with prime numerator and denominator.

We give a structure theorem for inside factorial domains. As an example we study the monoid of nonnegative integer solutions of equations of the form $a_1x_1+\cdots +a_{r-1}x_{r-1}=a_rx_r$, with $a_1,\ldots,a_r$ positive integers. This set…

We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.

Let $C_n=n2^n+1$ denote the $n$th Cullen number. There has been recent interest in finding all Cullen numbers having a given Diophantine property. We prove that, for a fixed integer $k$ and bounded integers $a_1,\ldots,a_k$, the greatest…

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…

We use bounds of mixed character sums modulo a prime $p$ to estimate the density of integer points on the hypersurface $$ f_1(x_1) + \ldots + f_n(x_n) =a x_1^{k_1} \ldots x_n^{k_n} $$ for some polynomials $f_i \in {\mathbb Z}[X]$, nonzero…