✦ LIBER ✦

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

✍ Scribed by Jordan Bell

Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 587 KB
Volume: 64
Category: Article
ISSN: 0003-9519
DOI: 10.1007/s00407-010-0057-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

q-Hypergeometric Proofs of Polynomial An

q-Hypergeometric Proofs of Polynomial Analogues of the Triple Product Identity, Lebesgue’s Identity and Euler’s Pentagonal Number Theorem

✍ S. Ole Warnaar 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 182 KB

On the convergence of the sequence defin

On the convergence of the sequence defining euler’s number

✍ Markus Brede 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 352 KB

On the computation of the Euler number o

On the computation of the Euler number of a binary object

✍ Juan L. Díaz-De-León S.; Juan Humberto Sossa-Azuela 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 443 KB

A note on Savage's theorem with a finite

A note on Savage's theorem with a finite number of states

✍ Thorsten Hens 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 540 KB

On some properties of the Euler's factor

On some properties of the Euler's factor of certain odd perfect numbers

✍ Paolo Starni 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 85 KB

Let n = 3 2 Q 2 be an odd positive integer, with prime, ≡ ≡ 1 (mod 4), Q squarefree, ). Some corollaries concerning the Euler's factor of odd perfect numbers of the above mentioned form, if any, are deduced.

On a formula for the number of Euler tra

On a formula for the number of Euler trails for a class of digraphs

✍ J Lauri 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 240 KB

In this note we give an elementary combinatorial proof of a formula of Macris and Pul6 for the number of Euler trails in a digraph all of whose vertices have in-degree and out-degree equal to2.