Related papers: A Diophantine inequality with four prime variables

We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…

We study the solubility of the binary additive equation $[m^c] + [p^c] = n$, where $m$ is an integer, $p$ is a prime number, and $c$ is a fixed real number in the range $1 < c < 3/2$.

In this article, we consider the Diophantine equation $\sigma_{2}(n)-n^2=An+B$ with $A=P^2\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\leq(|A|+|B|)^{3}$, all the solutions are expressible…

Given two relatively prime numbers $a$ and $b$, it is known that exactly one of the two Diophantine equations has a nonnegative integral solution $(x,y)$: $$ ax + by \ =\ \frac{(a-1)(b-1)}{2}\quad \mbox{ and }\quad 1 + ax + by \ =\…

In the fall 2011 issue of the Journal'Mathematics and Computer Education', author Unal Hasan, in the one page article "Proof without Words", gives a purely geometric proof of the equality, arctan(1/3)+ arctan(1/7) = arctan(1/2) (1) (See…

We shall show that, for any given primes $\ell\geq 17$ and $p, q\equiv 1\pmod{\ell}$, the diophantine equation $(x^\ell-1)/(x-1)=p^m q$ has at most four positive integral solutions $(x, m)$ and give its application to odd perfect number…

We will give an explicit upper bound for the number of solutions to cubic inequality |F(x, y)| \leq h, where F(x, y) is a cubic binary form with integer coefficients and positive discriminant D. Our upper bound is independent of h, provided…

The objective of the paper is to determine the complete solutions for the Diophantine equation $x^2 + 3^{\alpha}113^{\beta} = y^{\mathfrak{n}}$ in positive integers $x$ and $y$ (where $x, y \geq 1$), non-negative exponents $\alpha$ and…

Let $\alpha\in \mathbb{R}\setminus\mathbb{Q}$ and $\beta\in \mathbb{R}$ be given. Suppose that $a_1,\ldots,a_s$ are distinct positive integers that do not contain a reduced residue system modulo $p^2$ for any prime $p$. We prove that there…

We prove a theorem about approximation to an irrational number by rational numbers whose denominator n is free of prime factors bigger than a power of log n. We strengthen the result in version 1 by using an exponential sum over smooth…

In this paper, by using the elliptic curves theory, we study the fourth power Diophantine equation ${ \sum_{i=1}^n a_ix_{i} ^4= \sum_{j=1}^na_j y_{j}^4 }$, where $a_i$ and $n\geq3$ are fixed arbitrary integers. We solve the equation for…

Let $[\, \cdot\,]$ be the floor function. In this paper we show that when $1<c<\frac{3849}{3334}$, then there exist infinitely many prime numbers of the form $[n^c]$, where $n$ is square-free.

We show that if {1, b, c, d} is a D(-1) diophantine quadruple with b<c<d and c=1+s^2, then the cases s=p^k, s=2p^k, c=p and c=2p^k do not occur, where p is an odd prime and k is a positive integer. For the integer d=1+x^2, we show that it…

In this study we find all solutions of the Diophantine equation $B_{n_{1}}+B_{n_{2}}=2^{a_{1}}+2^{a_{2}}+2^{a_{3}}$ in positive integer variables $(n_{1},n_{2},a_{1},a_{2},a_{3}),$ where $B_{n}$ denotes the $n$-th balancing number.

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…

Without assuming the Northcott property we provide an upper bound on the number of "big solutions" of a special system of Diophantine inequalities over proper adelic curves. This system is interesting since it is a stronger version Roth's…

This paper is concerned with the diophantine equation $\sum_{i=1}^na_ix_i^4= \sum_{i=1}^na_iy_i^4$ where $n \geq 3$ and $a_i,\,i=1,\,2,\,\ldots,\,n$, are arbitrary integers. While a method of obtaining numerical solutions of such an…

In a simple integer chain, if $u_{i-1}$, $u_i$, and $u_{i+1}$ are three consecutive terms of the chain, and the pair $(u_{i-1}, u_i)$ has a certain property, then the next pair $(u_i, u_{i+1})$ also has the same property. We extend the idea…

Let L_t denote the t-th Lucas number. We prove that the Diophantine equation L_m^{n+k} + L_m^n = L_r has no solutions in positive integers r, m, n, and k with m >= 2. In the case n = 1, the proof is based on a precise factorization formula…

Let $S := \{p_1,\ldots ,p_{\ell}\}$ be a finite set of primes and denote by $\mathcal{U}_S$ the set of all rational integers whose prime factors are all in $S$. Let $(U_n)_{n\geq 0}$ be a non-degenerate linear recurrence sequence with order…