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 A Multi-Frey Approach to Some Multi-Parameter Families of Diophantine Equations

2008 ◽  
Vol 60 (3) ◽  
pp. 491-519 ◽  
Author(s):  
Yann Bugeaud ◽  
Maurice Mignotte ◽  
Samir Siksek
Keyword(s):  
Lower Bounds ◽  
Diophantine Equations ◽  
Galois Representations ◽  
Arbitrary Degree ◽  
Famous Theorem ◽  
Linear Forms ◽  
Positive Integers ◽  
Level Lowering

AbstractWe solve several multi-parameter families of binomial Thue equations of arbitrary degree; for example, we solve the equation5uxn − 2r3s yn = ±1,in non-zero integers x, y and positive integers u, r, s and n ≥ 3. Our approach uses several Frey curves simultaneously, Galois representations and level-lowering, new lower bounds for linear forms in 3 logarithms due to Mignotte and a famous theorem of Bennett on binomial Thue equations.

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.

scholarly journals COUNTING THE NUMBER OF SOLUTIONS TO THE ERDŐS–STRAUS EQUATION ON UNIT FRACTIONS

2013 ◽  
Vol 94 (1) ◽  
pp. 50-105 ◽  
Author(s):  
CHRISTIAN ELSHOLTZ ◽  
TERENCE TAO
Keyword(s):  
Positive Integer ◽  
Lower Bounds ◽  
Diophantine Equation ◽  
Upper And Lower Bounds ◽  
Natural Numbers ◽  
Number Of Solutions ◽  
Waring’S Problem ◽  
Unit Fractions ◽  
Image Position ◽  
Positive Integers

AbstractFor any positive integer $n$, let $f(n)$ denote the number of solutions to the Diophantine equation $$\begin{eqnarray*}\frac{4}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}\end{eqnarray*}$$ with $x, y, z$ positive integers. The Erdős–Straus conjecture asserts that $f(n)\gt 0$ for every $n\geq 2$. In this paper we obtain a number of upper and lower bounds for $f(n)$ or $f(p)$ for typical values of natural numbers $n$ and primes $p$. For instance, we establish that $$\begin{eqnarray*}N\hspace{0.167em} {\mathop{\log }\nolimits }^{2} N\ll \displaystyle \sum _{p\leq N}f(p)\ll N\hspace{0.167em} {\mathop{\log }\nolimits }^{2} N\log \log N.\end{eqnarray*}$$ These upper and lower bounds show that a typical prime has a small number of solutions to the Erdős–Straus Diophantine equation; small, when compared with other additive problems, like Waring’s problem.

On Equal Products of Consecutive Integers

1970 ◽  
Vol 13 (2) ◽  
pp. 255-259 ◽  
Author(s):  
R. A. Macleod ◽  
I. Barrodale
Keyword(s):  
Positive Integer ◽  
Diophantine Equation ◽  
Generalized Equation ◽  
Algebraic Numbers ◽  
Numerical Evidence ◽  
Consecutive Integers ◽  
Integer Solutions ◽  
Image Position ◽  
Positive Integers

Using the theory of algebraic numbers, Mordell [1] has shown that the Diophantine equation1possesses only two solutions in positive integers; these are given by n = 2, m = 1, and n = 14, m = 5. We are interested in positive integer solutions to the generalized equation2and in this paper we prove for several choices of k and l that (2) has no solutions, in other cases the only solutions are given, and numerical evidence for all values of k and l for which max (k, l) ≤ 15 is also exhibited.

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 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 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 Constants for lower bounds for linear forms in the logarithms of algebraic numbers II. The homogeneous rational case

1990 ◽  
Vol 55 (1) ◽  
pp. 15-22 ◽  
Author(s):  
Josef Blass ◽  
A. Glass ◽  
David Manski ◽  
David Meronk ◽  
Ray Steiner
Keyword(s):  
Lower Bounds ◽  
Algebraic Numbers ◽  
Linear Forms ◽  
Rational Case
Sign in / Sign up

Export Citation Format

Share Document