Results 111 to 120 of about 1,430,683 (165)
On the Diophantine equation $\frac{q^n-1}{q-1}=y$
summary:There exist many results about the Diophantine equation $(q^n-1)/(q-1)=y^m$, where $m\ge 2$ and $n\geq 3$. In this paper, we suppose that $m=1$, $n$ is an odd integer and $q$ a power of a prime number.
Khosravi, Amir, Khosravi, Behrooz
core +1 more source
柯召于“Note on the Diophantine equation xxyy=zz”(见Chinese Math.Journal1940)中证明了 ...
A.Schinzel
doaj
On the diophantine equation Px + Qy = z² [PDF]
Diophantine equation is a polynomial equation with two or more unknowns which integral solutions are required. An exponential Diophantine equation is an equation that has additional variable or variables occurring as exponents. This paper concentrates on
Japar, Izzati Izyani +2 more
core +1 more source
On the Diophantine Equation CZ2 = X5 + Y5
In this work we determine an infinit sequence of different values of C for which the diophantine equation Cz2 = x5 + y5 has no coprime non-trivial ...
Aldén, Erik, Söderlund, Gustaf
core +2 more sources
On the diophantine equation Fn + Fm = 2a
In this paper, we find all the solutions of the title Diophantine equation in positive integer variables (n, m, a), where Fk is the kth term of the Fibonacci sequence.
Luca, Florian, Bravo, Jhon J.
core
A Quantum Diophantine Equation Solution Finder
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 equality ...
Tatli, Lara, Stevenson, Paul
core
Undecidable diophantine equations [PDF]
openaire +2 more sources
Computing all integer solutions of a genus 1 equation [PDF]
The Elliptic Logarithm Method has been applied with great successto the problem of computing all integer solutions of equations ofdegree 3 and 4 defining elliptic curves. We extend this methodto include any equation f(u,v)=0 that defines a curve of genus
Stroeker, R.J., Tzanakis, N.
core
A remark on a Diophantine equation of S. S. Pillai
summary:S. S. Pillai proved that for a fixed positive integer $a$, the exponential Diophantine equation $x^y-y^x= a$, $\min (x,y)>1$, has only finitely many solutions in integers $x$ and $y$.
Hoque, Azizul
core +1 more source
ON A PARTICULAR DIOPHANTINE EQUATION
FERRENTINO, Rosa, BONIELLO, CARMINE
openaire +1 more source

