Results 81 to 90 of about 2,597 (231)
A radical diophantine equation [PDF]
All solutions in positive integers x, y z of the diophantine equation x1m + y1n = z1r are determined, where m, n, r are given positive integers. The proof makes use of a simple criterion for the irreducibility of the polynomial xn − a over the rationals,
Newman, Morris
core +1 more source
On the Diophantine equation x2+p2k+1=4yn
It has been proved that if p is an odd prime, y>1, k≥0, n is an integer greater than or equal to 4, (n,3h)=1 where h is the class number of the field Q(−p), then the equation x2+p2k+1=4yn has exactly five families of solution in the positive integers x ...
S. Akhtar Arif, Amal S. Al-Ali
doaj +1 more source
Formulae are given furnishing all non-trivial integer solutions of the equation \[ (x^2-t^2)(y^2-t^2)=\biggl(\biggl({y-x\over 2}\biggr)^2-t^2\biggr)^2 \] considered for \(t=1\) by the reviewer and \textit{W. Sierpiński} [Elem. Math. 18, 132--133 (1963; Zbl 0126.07301)].
openaire +2 more sources
A Repulsion Motif in Diophantine Equations [PDF]
Problems related to the existence of integral and rational points on cubic curves date back at least to Diophantus. A significant step in the modern theory of these equations was made by Siegel, who proved that a non-singular plane cubic equation has only finitely many integral solutions.
Everest, G, Ward, T
openaire +5 more sources
Double‐jump phase transition for the reverse Littlewood–Offord problem
Abstract Erdős conjectured in 1945 that for any unit vectors v1,…,vn$v_1, \ldots, v_n$ in R2$\mathbb {R}^2$ and signs ε1,…,εn$\varepsilon _1, \ldots, \varepsilon _n$ taken independently and uniformly in {−1,1}$\lbrace -1,1\rbrace$, the random Rademacher sum σ=ε1v1+⋯+εnvn$\sigma = \varepsilon _1 v_1 + \cdots + \varepsilon _n v_n$ satisfies ∥σ∥2⩽1$\Vert \
Lawrence Hollom +2 more
wiley +1 more source
On Some Methods for Solution of Linear Diophantine Equations
The paper considers a linear Diophantine equation. A method (algorithm) for finding a general class of solutions of equation is proposed. The proposed algorithm is explained by examples of equations with two and three variables, trying to direct the ...
Azam Imomov, Yorqin T. Khodjaev
doaj +1 more source
Abstract We survey ideas surrounding the study of the number of integers that can be represented as the sum of three positive cubes. We focus on the early contribution of Davenport using elementary techniques, and the subsequent developments due to Vaughan, which introduced Fourier analysis and mirrored many of the important developments of the Hardy ...
James Maynard
wiley +1 more source
On the Diophantine equation $\frac{q^n-1}{q-1}=y$ [PDF]
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
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
Diophantine Equation 4k2−1nx+4kny=4k2+1nz
Let a,b,c be a primitive Pythagorean triple such that a2+b2=c2 with 2b. In 1956, L. Jesmanowicz conjectured that, for any positive integer n, the equation anx+bny=cnz has only the positive solution x,y,z=2,2,2. In 1959, Lu Wenduan claimed that if n=1 and
Nai-juan Deng, Ridi Huang
doaj +1 more source

