Results 21 to 30 of about 3,575 (254)
A lower bound for linear forms in logarithms [PDF]
Acta Arithmetica, 1980 Michel Waldschmidt
exaly +3 more sources
A sharpening of the bounds for linear forms in logarithms [PDF]
Acta Arithmetica, 1972 exaly +3 more sources
On perfect powers in $k$-generalized Pell sequence [PDF]
Mathematica Bohemica, 2023 Let $k\geq2$ and let $(P_n^{(k)})_{n\geq2-k}$ be the $k$-generalized Pell sequence defined by \begin{equation*} P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots+P_{n-k}^{(k)} \end{equation*}for $n\geq2$ with initial conditions \begin{equation*} P_{-(k-2)}^{(
Zafer Şiar +2 more
doaj +1 more source
Mulatu Numbers Which Are Concatenation of Two Fibonacci Numbers
Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2023 Let (M_k) be the sequence of Mulatu numbers defined by M_0=4, M_1=1, M_k=M_(k-1)+M_(k-2) and (F_k) be the Fibonacci sequence given by the recurrence F_k=F_(k-1)+F_(k-2) with the initial conditions F_0=0, F_1=1 for k≥2.
Fatih Erduvan, Merve Güney Duman
doaj +1 more source
Fractional parts of powers of real algebraic numbers
Comptes Rendus. Mathématique, 2022 Let $\alpha $ be a real algebraic number greater than $1$. We establish an effective lower bound for the distance between an integral power of $\alpha $ and its nearest integer.
Bugeaud, Yann
doaj +1 more source
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
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
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