相关论文: Small prime solutions to cubic Diophantine equatio…

Given positive integers $a_1,...,a_n$ with $\gcd(a_1,...,a_n) = 1$, we call an integer t representable if there exist nonnegative integers $m_1,...,m_n$ such that $t = m_1 a_1 + ... + m_n a_n$. In this paper, we discuss the linear…

We deeply investigate the Diophantine equation $cx^2+d^{2m+1}=2y^n$ in integers $x, y\geq 1, m\geq 0$ and $n\geq 3$, where $c$ and $d$ are given coprime positive integers such that $cd\not\equiv 3 \pmod 4$. We first solve this equation for…

It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. In this…

While solving a special case of a question of Erd\H{o}s and Graham Steinerberger asks for all integers $n$ with $\phi(n)=\frac{2}{3} \cdot (n+1)$. He discovered the solutions $n\in\{5, 5 \cdot 7, 5\cdot 7\cdot 37, 5\cdot 7\cdot 37\cdot…

Motivated by the recent result of Farhi we show that for each $n\equiv \pm 1\pmod{6}$ the title Diophantine equation has at least two solutions in integers. As a consequence, we get that each (even) perfect number is a sum of three cubes of…

In this paper, we prove results about solutions of the Diophantine equation $x^p+y^p=z^3$ over various number fields using the modular method. Firstly, by assuming some standard modularity conjecture we prove an asymptotic result for…

We show that the decidability of an amplification of Hilbert's Tenth Problem in three variables implies the existence of uncomputably large integral points on certain algebraic curves. We obtain this as a corollary of a new positive…

We are interested in solving the congruences $f^3+g^3+1\equiv 0\pmod{fg}$ and $f^4-4g^2+4\equiv 0\pmod{fg}$ in polynomials $f, g$ with rational coefficients. Moreover, we present results of computations of all integer points on certain one…

Let $1<k<7/6$, $\lambda_1,\lambda_2,\lambda_3$ and $\lambda_4$ be non-zero real numbers, not all of the same sign such that $\lambda_1/\lambda_2$ is irrational and let $\omega$ be a real number. We prove that the inequality…

By using pairs of nontrivial rational solutions of congruent number equation $$ C_N:\;\;y^2=x^3-N^2x, $$ constructed are pairs of rational right (Pythagorean) triangles with one common side and the other sides equal to the sum and…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we generalize the result of Vaughan for ternary admissible exponent. Moreover, we use the refined admissible…

Let $n$ be a cubefree natural number and $p\geq 5$ be a prime number. Assume that $n$ is not expressible as a sum of the form $x^3+y^3$, where $x,y\in \mathbb{Q}$. In this note, we study the solutions (or lack thereof) to the equation…

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 $[\, \cdot\,]$ be the floor function. In this paper we show that every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p_1\log p_1]+[p_2\log p_2]+[p_3\log p_3], \end{equation*} where $p_1,\,…

We consider the number of solutions in positive integers $(x,y,z)$ for the purely exponential Diophantine equation $a^x+b^y =c^z$ (with $\gcd(a,b)=1$). Apart from a list of known exceptions, a conjecture published in 2016 claims that this…

Let $F_n$ denote the $n^{th}$ term of the Fibonacci sequence. In this paper, we investigate the Diophantine equation $F_1^p+2F_2^p+\cdots+kF_{k}^p=F_{n}^q$ in the positive integers $k$ and $n$, where $p$ and $q$ are given positive integers.…

In this paper we find a third order unimodular matrix, none of whose entries is $1$ or $-1$, such that when each entry of the matrix is replaced by its cube, the resulting matrix is also unimodular. Further, we find third order square…

We shall show that, for any positive integer $D>0$ and any primes $p_1, p_2$ not dividing $D$, the diophantine equation $x^2+D=2^s p_1^k p_2^l$ has at most $63$ integer solutions $(x, k, l, s)$ with $x, k, l\geq 0$ and $s\in \{0, 2\}$.

Let $\varphi_1,\ldots ,\varphi_r\in \mathbb Z[z_1,\ldots z_k]$ be integral linear combinations of elementary symmetric polynomials with $\text{deg}(\varphi_j)=k_j$ $(1\le j\le r)$, where $1\le k_1<k_2<\ldots <k_r=k$. Subject to the…

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…