Results 11 to 20 of about 3,579 (260)
A p-adic lower bound for a linear form in logarithms [PDF]
International Journal of Number Theory, 2022 Linear forms in logarithms have an important role in the theory of Diophantine equations. In this paper, we prove explicit [Formula: see text]-adic lower bounds for linear forms in [Formula: see text]-adic logarithms of rational numbers using Padé approximations of the second kind.
Seppälä Louna, Palojärvi Neea
openaire +4 more sources
Linear forms in logarithms and exponential Diophantine equations [PDF]
Hardy-Ramanujan Journal, 2020 This paper aims to show two things. Firstly the importance of Alan Baker's work on linear forms in logarithms for the development of the theory of exponential Diophantine equations. Secondly how this theory is the culmination of a series of greater and smaller discoveries.
Rob Tijdeman, Tijdeman, Rob
openaire +5 more sources
On the Diophantine Equation $\left(9d^2 + 1\right)^x + \left(16d^2 - 1\right)^y = (5d)^z$ Regarding Terai's Conjecture [PDF]
Journal of New TheoryThis study proves that the Diophantine equation $\left(9d^2+1\right)^x+\left(16d^2-1\right)^y=(5d)^z$ has a unique positive integer solution $(x,y,z)=(1,1,2)$, for all $d>1$.
Murat Alan, Tuba Çokoksen
doaj +2 more sources
Hypergeometric transformations of linear forms in one logarithm [PDF]
Functiones et Approximatio Commentarii Mathematici, 2008 We discuss hypergeometric constructions of rational approximations to values of the logarithm function.
Viola, Carlo, Zudilin, Wadim
openaire +5 more sources
Repdigits as difference of two Fibonacci or Lucas numbers
Математичні Студії, 2021 In the present study we investigate all repdigits which are expressed as a difference of two Fibonacci or Lucas numbers. We show that if $F_{n}-F_{m}$ is a repdigit, where $F_{n}$ denotes the $n$-th Fibonacci number, then $(n,m)\in \{(7,3),(9,1),(9,2 ...
P. Ray, K. Bhoi
doaj +1 more source
A kit for linear forms in three logarithms
Mathematics of Computation, 2023 We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds for linear forms in logarithms.
Maurice Mignotte, Paul Voutier
openaire +2 more sources
Repdigits as Product of Terms of k-Bonacci Sequences
Mathematics, 2021 For any integer k≥2, the sequence of the k-generalized Fibonacci numbers (or k-bonacci numbers) is defined by the k initial values F−(k−2)(k)=⋯=F0(k)=0 and F1(k)=1 and such that each term afterwards is the sum of the k preceding ones.
Petr Coufal, Pavel Trojovský
doaj +1 more source
Fermat $k$-Fibonacci and $k$-Lucas numbers [PDF]
Mathematica Bohemica, 2020 Using the lower bound of linear forms in logarithms of Matveev and the theory of continued fractions by means of a variation of a result of Dujella and Pethő, we find all $k$-Fibonacci and $k$-Lucas numbers which are Fermat numbers.
Jhon J. Bravo, Jose L. Herrera
doaj +1 more source
Linear forms in two logarithms and Schneider's method
Mathematische Annalen, 1978 Michel Waldschmidt +2 more
exaly +3 more sources
On Homogeneous Combinations of Linear Recurrence Sequences
Mathematics, 2020 Let (Fn)n≥0 be the Fibonacci sequence given by Fn+2=Fn+1+Fn, for n≥0, where F0=0 and F1=1. There are several interesting identities involving this sequence such as Fn2+Fn+12=F2n+1, for all n≥0. In 2012, Chaves, Marques and Togbé proved that if (Gm)m is a
Marie Hubálovská +2 more
doaj +1 more source