✦ LIBER ✦

On the convergence of the sequence defining euler’s number

✍ Scribed by Markus Brede

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 352 KB
Volume: 27
Category: Article
ISSN: 0343-6993
DOI: 10.1007/bf02985832

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On new sequences converging towards the

On new sequences converging towards the Euler–Mascheroni constant

✍ Cristinel Mortici 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 243 KB

On the Euler characteristic of definable

On the Euler characteristic of definable groups

✍ Mário J. Edmundo 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB

We show that in an arbitrary o-minimal structure the following are equivalent: (i) conjugates of a definable subgroup of a definably connected, definably compact definable group cover the group if the o-minimal Euler characteristic of the quotient is non zero; (ii) every infinite, definably connecte

On the Euler number of an orbifold

✍ Friedrich Hirzebruch; Thomas Höfer 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 243 KB

A summary of Euler’s work on the pentago

A summary of Euler’s work on the pentagonal number theorem

✍ Jordan Bell 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 587 KB

On the convergence of uncertain sequence

On the convergence of uncertain sequences

✍ Cuilian You 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 351 KB

On the maximum number of pairwise compat

On the maximum number of pairwise compatible euler cycles

✍ H. Fleischner; A. J. W. Hilton; Bill Jackson 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 629 KB

## Abstract B. Jackson [4] made the following conjecture: If __G__ is an Eulerian graph with δ(__G__) ≥ 2__k__, then __G__ has a set of 2__k__ ‐ 2 pairwise compatible Euler cycles (i.e., every pair of adjacent edges appears in at most one of these Euler cycles as a pair of consecutive edges). We ve