Results 91 to 100 of about 580,253 (234)
GCD inequalities arising from codimension‐2 blowups
Abstract Assuming a deep Diophantine geometry conjecture by Vojta, Silverman proved an inequality giving an upper bound for the greatest common divisor (GCD). In this paper, we unconditionally prove a weaker version of this inequality. The main ingredient is the Ru–Vojta theory, which provides an efficient method of using Schmidt subspace theorem.
Yu Yasufuku
wiley +1 more source
Some bounds related to the 2‐adic Littlewood conjecture
Abstract For every irrational real α$\alpha$, let M(α)=supn⩾1an(α)$M(\alpha) = \sup _{n\geqslant 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or ∞$\infty$, if unbounded). The 2‐adic Littlewood conjecture (2LC) can be stated as follows: There exists no irrational α$\alpha$ such that M(2kα)$M(2^k \alpha)$ is ...
Dinis Vitorino, Ingrid Vukusic
wiley +1 more source
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 +1 more source
On the diophantine equation Fn + Fm = 2a [PDF]
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
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 $\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 number of solutions to a diophantine equation [PDF]
Let A1, …, Ar, x1, …, xr, and A be known positive integers. Let f(A) be the number of integer solutions (x1, …, xr) satisfying the Diophantine equation ∑j=1rAjxj = A and the conditions 0 ⩽ xi ⩽ xj, j = 1, …, r.
Faaland, Bruce
core +1 more source
Diophantine Equations and Linear Recurrences [PDF]
Ph.D. Thesis defense.
openaire +1 more source
Distribution of integer points on determinant surfaces and a mod‐p analogue
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
Multiplication polynomials and relative Manin-Mumford [PDF]
After the introduction we prove in chapter 2 that the resultant of the standard multiplication polynomials $A_n,B_n$ of an elliptic curve in the form $y^2 = x^3+ax+b$ is $(16\Delta)^{{n^2(n^2-1) \over 6}}$, where $\Delta=-(4a^3+27b^2)$ is the ...
Schmidt, Harry
core +1 more source

