Simultaneous approximation of numbers connected with the exponential function

1978 ◽  
Vol 25 (4) ◽  
pp. 466-478 ◽  
Author(s):  
Michel Waldschmidt
Keyword(s):  
Lower Bounds ◽  
Exponential Function ◽  
Complex Number ◽  
Simultaneous Approximation ◽  
Complex Numbers ◽  
Linear Forms In Logarithms ◽  
Algebraic Numbers ◽  
Linear Forms

AbstractWe give several results concerning the simultaneous approximation of certain complex numbers. For instance, we give lower bounds for |a–ξo |+ | ea – ξ1 |, where a is any non-zero complex number, and ξ are two algebraic numbers. We also improve the estimate of the so-called Franklin Schneider theorem concerning | b – ξ | + | a – ξ | + | ab – ξ. We deduce these results from an estimate for linear forms in logarithms.

Fibonacci numbers in generalized Pell sequences

2020 ◽  
Vol 70 (5) ◽  
pp. 1057-1068
Author(s):  
Jhon J. Bravo ◽  
Jose L. Herrera
Keyword(s):  
Lower Bounds ◽  
Continued Fractions ◽  
Fibonacci Numbers ◽  
Independent Interest ◽  
Linear Forms In Logarithms ◽  
Algebraic Numbers ◽  
Linear Forms ◽  
Pell Numbers

AbstractIn this paper, by using lower bounds for linear forms in logarithms of algebraic numbers and the theory of continued fractions, we find all Fibonacci numbers that appear in generalized Pell sequences. Some interesting estimations involving generalized Pell numbers, that we believe are of independent interest, are also deduced. This paper continues a previous work that searched for Fibonacci numbers in the Pell sequence.

scholarly journals Tribonacci numbers that are concatenations of two repdigits

2020 ◽  
Vol 114 (4) ◽  
Author(s):  
Mahadi Ddamulira
Keyword(s):  
Lower Bounds ◽  
Linear Forms In Logarithms ◽  
Algebraic Numbers ◽  
Reduction Procedure ◽  
Linear Forms ◽  
Tribonacci Numbers

Abstract Let $$ (T_{n})_{n\ge 0} $$ ( T n ) n ≥ 0 be the sequence of Tribonacci numbers defined by $$ T_0=0 $$ T 0 = 0 , $$ T_1=T_2=1$$ T 1 = T 2 = 1 , and $$ T_{n+3}= T_{n+2}+T_{n+1} +T_n$$ T n + 3 = T n + 2 + T n + 1 + T n for all $$ n\ge 0 $$ n ≥ 0 . In this note, we use of lower bounds for linear forms in logarithms of algebraic numbers and the Baker-Davenport reduction procedure to find all Tribonacci numbers that are concatenations of two repdigits.

scholarly journals Simultaneous approximation of et and ℘(t)

1982 ◽  
Vol 33 (2) ◽  
pp. 171-178
Author(s):  
K. Saradha
Keyword(s):  
Complex Number ◽  
Elliptic Function ◽  
Simultaneous Approximation ◽  
Algebraic Numbers ◽  
Weierstrass Elliptic Function ◽  
Algebraic Invariants ◽  
Image Position

AbstractLet t be any complex number different from the poles of a Weierstrass elliptic function ℘(z), having algebraic invariants. Then we estimate from below the sum where α and β are algebraic numbers. The estimate is given in terms of the heights of α and β and the degree of the field Q(α, β), where Q is the field of rationals.

scholarly journals Fibonacci Numbers with a Prescribed Block of Digits

Mathematics ◽  
2020 ◽  
Vol 8 (4) ◽  
pp. 639 ◽  
Author(s):  
Pavel Trojovský
Keyword(s):  
Lower Bounds ◽  
Diophantine Approximation ◽  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Algebraic Numbers ◽  
Decimal Expansion ◽  
Linear Forms

In this paper, we prove that F 22 = 17711 is the largest Fibonacci number whose decimal expansion is of the form a b … b c … c . The proof uses lower bounds for linear forms in three logarithms of algebraic numbers and some tools from Diophantine approximation.

scholarly journals Mordell’s equation: a classical approach

2015 ◽  
Vol 18 (1) ◽  
pp. 633-646 ◽  
Author(s):  
Michael A. Bennett ◽  
Amir Ghadermarzi
Keyword(s):  
Lower Bounds ◽  
Diophantine Equation ◽  
Classical Approach ◽  
Linear Forms In Logarithms ◽  
Lattice Basis Reduction ◽  
Linear Forms ◽  
Basis Reduction

We solve the Diophantine equation$Y^{2}=X^{3}+k$for all nonzero integers$k$with$|k|\leqslant 10^{7}$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower bounds for linear forms in logarithms in conjunction with lattice-basis reduction.

On Some Exponential Equations of S. S. Pillai

2001 ◽  
Vol 53 (5) ◽  
pp. 897-922 ◽  
Author(s):  
Michael A. Bennett
Keyword(s):  
Lower Bounds ◽  
Diophantine Equation ◽  
Prior Work ◽  
Algebraic Numbers ◽  
Linear Forms ◽  
Sharp Result ◽  
Exponential Equations ◽  
Positive Integers

AbstractIn this paper, we establish a number of theorems on the classic Diophantine equation of S. S. Pillai, ax – by = c, where a, b and c are given nonzero integers with a, b ≥ 2. In particular, we obtain the sharp result that there are at most two solutions in positive integers x and y and deduce a variety of explicit conditions under which there exists at most a single such solution. These improve or generalize prior work of Le, Leveque, Pillai, Scott and Terai. The main tools used include lower bounds for linear forms in the logarithms of (two) algebraic numbers and various elementary arguments.

scholarly journals Estimating Mahler's measure

1995 ◽  
Vol 51 (1) ◽  
pp. 145-151
Author(s):  
G.R. Everest
Keyword(s):  
Linear Forms In Logarithms ◽  
Algebraic Numbers ◽  
Linear Forms ◽  
Riemann Sums ◽  
Integer Polynomials ◽  
Several Variables ◽  
Logarithmic Integral ◽  
Baker's Theorem

In 1962, Mahler defined a measure for integer polynomials in several variables as the logarithmic integral over the torus. Many results exist about the values taken by the measure but many unsolved problems remain. In one variable, it is possible to express the measure as an effective limit of Riemann sums. We show that the same is true in several variables, using a non-obvious parametrisation of the torus together with Baker's Theorem on linear forms in logarithms of algebraic numbers.

scholarly journals Quelques remarques sur des questions d'approximation diophantienne

1999 ◽  
Vol 59 (2) ◽  
pp. 323-334 ◽  
Author(s):  
Patrice Philippon
Keyword(s):  
Lower Bounds ◽  
Approximation Theory ◽  
Diophantine Approximation ◽  
Rational Numbers ◽  
Product Theorem ◽  
Linear Forms In Logarithms ◽  
Linear Forms ◽  
Subspace Theorem

Hoping for a hand-shake between methods from diophantine approximation theory and transcendance theory, we show how zeros estimates from transcendance theory imply Roth's type lemmas (including the product theorem). We also formulate some strong conjectures on lower bounds for linear forms in logarithms of rational numbers with rational coefficients, inspired by the subspace theorem and which would imply, for example, the abc conjecture.

scholarly journals Constants for lower bounds for linear forms in the logarithms of algebraic numbers I. The general case

1990 ◽  
Vol 55 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Josef Blass ◽  
A. Glass ◽  
David Manski ◽  
David Meronk ◽  
Ray Steiner
Keyword(s):  
Lower Bounds ◽  
Algebraic Numbers ◽  
Linear Forms

scholarly journals Exponential forms and path integrals for complex numbers inndimensions

2001 ◽  
Vol 25 (7) ◽  
pp. 429-450 ◽  
Author(s):  
Silviu Olariu
Keyword(s):  
Exponential Function ◽  
Complex Number ◽  
Path Integrals ◽  
Complex Numbers ◽  
Complex Polynomials ◽  
Hyperbolic Sine ◽  
Complex Functions ◽  
Geometric Variables ◽  
Sine And Cosine Functions ◽  
Cosine Functions

Two distinct systems of commutative complex numbers inndimensions are described, of polar and planar types. Exponential forms ofn-complex numbers are given in each case, which depend on geometric variables. Azimuthal angles, which are cyclic variables, appear in these forms at the exponent, and this leads to the concept of residue for path integrals ofn-complex functions. The exponential function of ann-complex number is expanded in terms of functions called in this paper cosexponential functions, which are generalizations tondimensions of the circular and hyperbolic sine and cosine functions. The factorization ofn-complex polynomials is discussed.

Sign in / Sign up

Export Citation Format

Share Document