相关论文: Solving diophantine equations x^4 + y^4 = q z^p

We prove that for each odd prime p, positive integer alpha, and non-negative integers beta and gamma, the Diophantine equation X^{2N} + 2^{2 alpha} 5^{2 beta} p^{2 gamma} = Z^5 has no solution with X, Z, N in Z^+, N > 1, and gcd(X,Z) = 1.

A solution $(x,y,z) \in \mathbb{Z}^3-\{(0,0,0)\}$ to a generalized Fermat equation \[ Ax^a + By^b + Cz^c = 0, \] is called \emph{primitive} if $\gcd(x,y,z) = 1$. By work of Beukers, we know that in the \emph{spherical} regime (that is, when…

The Modular Group provides simple proofs of Fermat's representations: X^2+Y^2 for primes congruent to 1 (mod 4) and by X^2+3Y^2 for primes congruent to 1 (mod 3)

We prove that there are no Wieferich's primes $q=2p+1$ where $p \equiv 3 \pmod{4}$ is a prime number

Let $K$ be a totally real number field and consider a Fermat-type equation $Aa^p+Bb^q=Cc^r$ over $K$. We call the triple of exponents $(p,q,r)$ the signature of the equation. We prove various results concerning the solutions to the Fermat…

In this paper, we consider the Diophantine equation $(-1)^{\alpha}p^x+(-1)^{\beta}(2^k(2p+1))^y=z^2$ for Sophie Germain prime $p$ with $\alpha, \beta \in\{0,1\}$, $\alpha\beta=0$ and $k\geq 0$. First, for $p=2$, we solve three Diophantine…

In this paper, we give all the solutions of the Diophantine equation x^2+7^{alpha}.11^{beta}=y^n, in nonnegative integers x, y, n>=3 with x and y coprime, except for the case when alpha.x is odd and beta is even.

In a recent paper, Freitas and Siksek proved an asypmtotic version of Fermat's Last Theorem for many totally real fields. We prove an extension of their result to generalized Fermat equations of the form $A x^p+B y^p+ C z^p=0$, where $A$,…

We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…

The main idea of this article is simply calculating integer functions in module. The algebraic in the integer modules is studied in completely new style. By a careful construction, a result is proven that two finite numbers is with unequal…

We show the insolvability of the Diophantine equation $ax^d-y^2-z^2+xyz-b=0$ in $\mathbb{Z}$ for fixed $a$ and $b$ such that $a\equiv 1 \pmod {12}$ and $b=2^da-3$, where $d$ is an odd integer and is a multiple of $3$. Further, we…

In this paper, we solve the simultaneous Diophantine equations m.(x_1^k+....+x_{t_1}^k)=n.(y_1^k+....+y_{t_2}^k); k=1,3, where t_1, t_2>3, and m, n are fixed arbitrary and relatively prime positive integers. This is done by choosing two…

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 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.

In this paper, show that the Diophantine equation $ x^2+(x+1)^2=w^4 $ has only two solutions $ (0,1) $ and $ (119,13)$ in non-negative integers $ x $ and $ w $. This equation concerned a classic problem posed by Pierre de Fermat, wonders…

Suppose that $x$ is odd, $n\geq7$ and $p\notin\{2,5\}$ are primes. In this paper, we prove that the Diophantine equations $x^{2}\pm5^{\alpha}p^{n}=y^{n}$ have no solutions in positive integers $\alpha,x,y$ with $gcd(x,y)=1$.

We obtain sharp upper and lower bounds on a certain four-dimensional Frobenius number determined by a prime pair $(p,q)$, $2<p<q$, including exact formulae for two infinite subclasses of such pairs. Our work is motivated by the study of…

In this paper, we develop the modular method for the generalized Fermat equation appearing in the title, within the framework of Darmon's program and using Frey hyperelliptic curves. As an application, we study a conjecture of Laradji,…

A new formulation of the subject equation is presented. Several parametric and semi-parametric solutions are derived. The parametric solution for a=-1 was originally presented in 1972, but never published. A computer-generated version was…

We provide several extensions of the modular method which were motivated by the problem of completing previous work to prove that, for any integer $n \geq 2$, the equation \[ x^{13} + y^{13} = 3 z^n \] has no non-trivial solutions. In…