𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algebraic Independence of Sums of Reciprocals of the Fibonacci Numbers

✍ Scribed by Kumlko Nishioka; Taka-Aki Tanaka; Takeshi Toshimitsu


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
468 KB
Volume
202
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis


Algebraic independence of the numbers -(%ah . .-, sequence of integers satisfying a binary linear recurrence relation and { b h ] h ~o is a periodic sequence of algebraic numbers not identically zero, are studied.


πŸ“œ SIMILAR VOLUMES


A Combinatorial Interpretation of the Ge
✍ Emanuele Munarini πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 181 KB

In this paper the generalized Fibonacci numbers of order k are combinatorially interpreted, in the context of the theory of linear species of Joyal, as the linear species of k-filtering partitions.

On the spectral norm of algebraic number
✍ Angel Popescu; Nicolae Popescu; Alexandru Zaharescu πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 139 KB

## Abstract In this paper we continue to study the spectral norms and their completions ([4]) in the case of the algebraic closure \documentclass{article} \usepackage{amssymb} \pagestyle{empty} \begin{document} $ \overline {\mathbb Q} $ \end{document} of β„š in β„‚. Let \documentclass{article} \usepack

On the Convergence of Series of Reciproc
✍ Michal KΕ™Δ±́ΕΎek; Florian Luca; Lawrence Somer πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 158 KB

We examine densities of several sets connected with the Fermat numbers F m ΒΌ 2 2 m ΓΎ 1: In particular, we prove that the series of reciprocals of all prime divisors of Fermat numbers is convergent. We also show that the series of reciprocals of elite primes is convergent.

Computing in the Field of Complex Algebr
✍ ADAM WOJCIECH STRZEBOΕƒSKI πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 371 KB

In this paper we present two methods of computing with complex algebraic numbers. The first uses isolating rectangles to distinguish between the roots of the minimal polynomial, the second method uses validated numeric approximations. We present algorithms for arithmetic and for solving polynomial e