✦ LIBER ✦

A Note On Bernoulli Numbers

✍ Scribed by I.S. Slavutskii

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 63 KB
Volume: 53
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.1995.1093

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Hardy's Persistent Numbers

✍ Rod McBeth 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 1 views

A note on Ramsey numbers for books

✍ Vladimir Nikiforov; Cecil C. Rousseau 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## Abstract The __book with n pages__ __B__~__n__~ is the graph consisting of __n__ triangles sharing an edge. The __book Ramsey number__ __r__(__B__~__m__~,__B__~__n__~) is the smallest integer __r__ such that either __B__~__m__~ ⊂ __G__ or __B__~__n__~ ⊂ __G__ for every graph __G__ of order __r__

A note on partial numberings

✍ Serikzhan Badaev; Dieter Spreen 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Dedicated to Klaus Weihrauch on the occasion of his 60th birthday. The different behaviour of total and partial numberings with respect to the reducibility preorder is investigated. Partial numberings appear quite naturally in computability studies for topological spaces. The degrees of partial

Applications of a Recurrence for the Ber

Applications of a Recurrence for the Bernoulli Numbers

✍ F.T. Howard 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 416 KB

We give an easy proof of a recently published recurrence for the Bernoulli numbers and we present some applications of the recurrence. One of the applications is a simple proof of the well-known Staudt-Clausen Theorem. Proofs are also given for theorems of Carlitz. Frobenius, and Ramanujan. An analo

A note on the bichromatic numbers of gra

A note on the bichromatic numbers of graphs

✍ Dennis D. A. Epple; Jing Huang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB 👁 2 views

A note on constructive methods for ramse

A note on constructive methods for ramsey numbers

✍ F. R. K. Chung 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB 👁 1 views

## Abstract Let __r(k__) denote the least integer __n__‐such that for any graph __G__ on __n__ vertices either __G__ or its complement G contains a complete graph __K__~k~ on __k__ vertices. in this paper, we prove the following lower bound for the Ramsey number __r(k__) by explicit construction: _