✦ LIBER ✦

Transcendence of reciprocal sums of binary recurrences

✍ Scribed by Tomoaki Kanoko; Takeshi Kurosawa; Iekata Shiokawa

Publisher: Springer Vienna
Year: 2008
Tongue: English
Weight: 221 KB
Volume: 157
Category: Article
ISSN: 0026-9255
DOI: 10.1007/s00605-008-0073-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Transcendence of Certain Reciprocal Sums

Transcendence of Certain Reciprocal Sums of Linear Recurrences

✍ Daniel Duverney; Tomoaki Kanoko; Taka-aki Tanaka 📂 Article 📅 2002 🏛 Springer Vienna 🌐 English ⚖ 130 KB

Algebraic independence of reciprocal sum

Algebraic independence of reciprocal sums of binary recurrences

✍ Kumiko Nishioka 📂 Article 📅 1997 🏛 Springer Vienna 🌐 English ⚖ 478 KB

Algebraic Independence of Reciprocal Sum

Algebraic Independence of Reciprocal Sums of Binary Recurrences II

✍ Kumiko Nishioka 📂 Article 📅 2002 🏛 Springer Vienna 🌐 English ⚖ 151 KB

Transcendency Results for Sums of Recipr

Transcendency Results for Sums of Reciprocals of Linear Recurrences

✍ Paul-Georg Becker; Thomas Töpper 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

## Abstract Suppose that {__R~n~__}__n__≥0 is a linear recursive sequence and __d__ ≥ 2 is an integer. Under suitable conditions on {__R~n~__} and __d__ we show that and similarly constructed numbers are transcendental. Special attention is given to the case of binary recurrences.

Transcendence of certain series involvin

Transcendence of certain series involving binary linear recurrences

✍ Takeshi Kurosawa 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Duverney and Nishioka [D. Duverney, Ku. Nishioka, An inductive method for proving the transcendence of certain series, Acta Arith. 110 (4) (2003) 305-330] studied the transcendence of k 0 , where E k (z), F k (z) are polynomials, α is an algebraic number, and r is an integer greater than 1, using a

Sums of Factorials in Binary Recurrence

Sums of Factorials in Binary Recurrence Sequences

✍ George Grossman; Florian Luca 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 141 KB

In this paper, we consider the problem of expressing a term of a given nondegenerate binary recurrence sequence as a sum of factorials. We show that if one bounds the number of factorials allowed, then there are only finitely many effectively computable terms which can be represented in this way. As