Results 11 to 20 of about 7,373 (275)

Linear forms in elliptic logarithms [PDF]

open access: yesJournal of Number Theory, 1985
The author studies lower bounds for linear forms in elliptic integrals in the case of complex multiplications, and related estimates for dependence relations of such numbers. His results considerably improves on the previous works of D. Masser and M. Anderson on these topics, the main feature being a sharp dependence on the heights of the corresponding
Kunrui Yu
exaly   +4 more sources

A p-adic lower bound for a linear form in logarithms [PDF]

open access: yesInternational 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

Fermat $k$-Fibonacci and $k$-Lucas numbers [PDF]

open access: yesMathematica 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   +4 more sources

Linear forms in two logarithms and interpolation determinants [PDF]

open access: yesActa Arithmetica, 1994
The author provides a precise lower bound for the absolute value of a linear combination of two logarithms of real algebraic numbers with integer coefficients. This lower bound is explicit and improves in the real case an earlier result of \textit{M. Mignotte} and \textit{M. Waldschmidt} [Ann. Fac. Sci. Toulouse Math.
Laurent, Michel
openaire   +4 more sources

Fibonacci Numbers with a Prescribed Block of Digits [PDF]

open access: yesMathematics, 2020
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 ...
Pavel Trojovský
doaj   +2 more sources

Matrices whose coefficients are linear forms in logarithms

open access: yesJournal of Number Theory, 1992
Denote by \(L\) the \({\mathbb{Q}}\)-vector space of complex numbers \(\ell\) such that \(e^{\ell}\) is an algebraic number, and by \({\mathcal L}\) the vector space generated by \(1\) and \(L\) over the field \(\overline\mathbb{Q}\) of algebraic numbers.
Damien Roy
exaly   +2 more sources

Repdigits in the base $b$ as sums of four balancing numbers [PDF]

open access: yesMathematica Bohemica, 2021
The sequence of balancing numbers $(B_n)$ is defined by the recurrence relation $B_n=6B_{n-1}-B_{n-2}$ for $n\geq2$ with initial conditions $B_0=0$ and $B_1=1.$ $B_n$ is called the $n$th balancing number. In this paper, we find all repdigits in the base $
Refik Keskin, Fatih Erduvan
doaj   +1 more source

Curious Generalized Fibonacci Numbers

open access: yesMathematics, 2021
A generalization of the well-known Fibonacci sequence is the k−Fibonacci sequence whose first k terms are 0,…,0,1 and each term afterwards is the sum of the preceding k terms. In this paper, we find all k-Fibonacci numbers that are curious numbers (i.e.,
Jose L. Herrera   +2 more
doaj   +1 more source

A kit for linear forms in three logarithms

open access: yesMathematics 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

On $k$-Fibonacci balancing and $k$-Fibonacci Lucas-balancing numbers

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2021
The balancing number $n$ and the balancer $r$ are solution of the Diophantine equation $$1+2+\cdots+(n-1) = (n+1)+(n+2)+\cdots+(n+r). $$ It is well known that if $n$ is balancing number, then $8n^2 + 1$ is a perfect square and its positive square root is
S.E. Rihane
doaj   +1 more source

Home - About - Disclaimer - Privacy