Results 81 to 90 of about 2,595 (231)
Diophantine equations in partitions [PDF]
Mathematics of Computation, 1984 Given positive integers r 1
openaire +1 more source
Mathematika, Volume 72, Issue 2, April 2026.Abstract In 2019 Kleinbock and Wadleigh proved a “zero‐one law” for uniform inhomogeneous Diophantine approximations. We generalize this statement to arbitrary weight functions and establish a new and simple proof of this statement, based on the transference principle. We also give a complete description of the sets of g$g$‐Dirichlet pairs with a fixed
Vasiliy Neckrasov
wiley +1 more source
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
Journal of MathematicsLet 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
On the Diophantine equation Ax2+22m=yn
International Journal of Mathematics and Mathematical Sciences, 2001 Let h denote the class number of the quadratic field ℚ(−A) for a square free odd integer A>1, and suppose that n>2 is an odd integer with (n,h)=1 and m>1.
Fadwa S. Abu Muriefah
doaj +1 more source
Distribution of integer points on determinant surfaces and a mod‐p analogue
Mathematika, Volume 72, Issue 2, April 2026.Abstract We establish an asymptotic formula for counting integer solutions with smooth weights to an equation of the form xy−zw=r$xy-zw=r$, where r$r$ is a non‐zero integer, with an explicit main term and a strong bound on the error term in terms of the size of the variables x,y,z,w$x, y, z, w$ as well as of r$r$.
Satadal Ganguly, Rachita Guria
wiley +1 more source
The diophantine equation ni+1=k(dn−1)
International Journal of Mathematics and Mathematical Sciences, 1989 The Diophantine equation of the title is solved for i=3,4 and an infinite family of solutions were found for i≥5.
Steve Ligh, Keith Bourque
doaj +1 more source
An exponential diophantine equation [PDF]
Bulletin of the Australian Mathematical Society, 2001 Let p be an odd prime with p > 3. In this paper we give all positive integer solutions (x, y, m, n) of the equation x2 + p2m = yn, gcd (x, y) = 1, n > 2 satisfying 2 | n of 2 ∤ n and p ≢ (−1)(p−1)/2(mod 4n.
openaire +1 more source
f$f$‐Diophantine sets over finite fields via quasi‐random hypergraphs from multivariate polynomials
Mathematika, Volume 72, Issue 2, April 2026.Abstract We investigate f$f$‐Diophantine sets over finite fields via new explicit constructions of families of quasi‐random hypergraphs from multivariate polynomials. In particular, our construction not only offers a systematic method for constructing quasi‐random hypergraphs but also provides a unified framework for studying various hypergraphs ...
Seoyoung Kim, Chi Hoi Yip, Semin Yoo
wiley +1 more source
Symmetric Diophantine Equations
Rocky Mountain Journal of Mathematics, 2004 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