Results 61 to 70 of about 13,363 (161)
On a variant of Pillai's problem involving <i>S</i>-units and Fibonacci numbers. [PDF]
Ziegler V.
europepmc +1 more source
Mixing Rates of the Geometrical Neutral Lorenz Model. [PDF]
Bruin H, Canales Farías HH.
europepmc +1 more source
Finding all S-Diophantine quadruples for a fixed set of primes S. [PDF]
Ziegler V.
europepmc +1 more source
Asymptotic Diophantine Approximations [PDF]
openaire +2 more sources
Introduction to Diophantine Approximation
Abstract In this article we formalize some results of Diophantine approximation, i.e. the approximation of an irrational number by rationals. A typical example is finding an integer solution (x, y) of the inequality |xθ − y| ≤ 1/x, where 0 is a real number. First, we formalize some lemmas about continued fractions. Then we prove that the
openaire +2 more sources
Summing μ ( n ) : a faster elementary algorithm. [PDF]
Helfgott HA, Thompson L.
europepmc +1 more source
On prime powers in linear recurrence sequences. [PDF]
Odjoumani J, Ziegler V.
europepmc +1 more source
Sequences of Diophantine approximations
AbstractWe sharpen a technique of Gelfond to show that, in a sense, the only possible gap-free sequences of “good” Diophantine approximations to a fixed α ∈ C are trivial ones. For example, suppose that a > 1 and that (δn)n=1∞ and (σn)n=1∞ are two positive, strictly increasing unbounded sequences satisfying δn+1 ≤ aδn and σn+1 ≤ aσn.
openaire +1 more source
A note on Diophantine approximation
J. M. Almira +2 more
doaj +1 more source
Unconventional height functions in simultaneous Diophantine approximation. [PDF]
Fishman L, Simmons D.
europepmc +1 more source

