Results 81 to 90 of about 1,430,683 (165)
On the exceptional set in Littlewood's discrete conjecture
Abstract We consider a discrete analogue of the well‐known Littlewood conjecture on Diophantine approximations and obtain a strong upper bound for the number of exceptional vectors in this conjecture.
I. D. Shkredov
wiley +1 more source
On the Diophantine equation x2+2k=yn
By factorizing the equation x2+2k=yn, n≥3, k-even, in the field Q(i), various theorems regarding the solutions of this equation in rational integers are proved.
S. Akhtar Arif, Fadwa S. Abu Muriefah
doaj +1 more source
Symmetric Diophantine Equations
The author describes a method to obtain infinite parametric solutions of some Diophantine equations of type \(f(x,y)=f(u,v)\) where \(f\) is a form (usually the product of some linear and quadratic forms) with rational coefficients. The main idea is to apply a non-singular linear transformation \(x=\alpha u+\beta v\), \(y=\gamma u+\delta v\) such that ...
openaire +2 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
The Exponential Diophantine Equation 2x+by=cz
Let b and c be fixed coprime odd positive integers with min{b,c}>1. In this paper, a classification of all positive integer solutions (x,y,z) of the equation 2x+by=cz is given. Further, by an elementary approach, we prove that if c=b+2, then the equation
Yahui Yu, Xiaoxue Li
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
Bound on some Diophantine equation
Diophantine equation is known as a polynomial equation with two or more unknowns which only integral solutions are sought. This paper will concentrate on finding the least upper bound to the Diophantine equation x 2 + 2a 7 b = y n for 1 ≤ α ≤ 8 and found
Amalulhair, N. H. +2 more
core
HNN extensions and embedding theorems for groups
Abstract The Higman–Neumann–Neumann (HNN) paper of 1949 is a landmark of group theory in the 20th century. The proof of its main theorem covers less than a page and uses only pre‐existing technology, but the construction that it introduced, the HNN extension, quickly became one of the principal tools of combinatorial group theory, widely used to build ...
Martin R. Bridson +1 more
wiley +1 more source
The Diophantine equation ax2+2bxy−4ay2=±1
We discuss, with the aid of arithmetical properties of the ring of the Gaussian integers, the solvability of the Diophantine equation ax2+2bxy−4ay2=±1, where a and b are nonnegative integers.
Lionel Bapoungué
doaj +1 more source
On the Diophantine equation 2x + 11y = z2 [PDF]
In this paper it is shown that (3,0,3) is the only non-negative integer solution of the Diophantine equation 2x + 11y = z2.
Somchit Chotchaisthit
doaj

