𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Reference to Perfect Numbers in Plato’sTheaetetus

✍ Scribed by F. Acerbi

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
226 KB
Volume
59
Category
Article
ISSN
0003-9519

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of perfect matchings in a hyp
The number of perfect matchings in a hypercube
✍ Niall Graham; Frank Harary 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 243 KB

A perfect matching or a l-factor of a graph G is a spanning subgraph that is regular of degree one. Hence a perfect matching is a set of independent edges which matches all the nodes of G in pairs. Thus in a hypercube parallel processor, the number of perfect matchings evaluates the number of diff

On the number of blocks in a perfect cov
On the number of blocks in a perfect covering of υ points
✍ Rolf Rees; D.R. Stinson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 710 KB

In this paper, we study bounds on gck'(v), which denotes the minimum number of blocks to cover every pair of a v-set exactly once, when the largest block has size k. This bound is exact when v < 2k, but becomes progressively weaker as u increases (for any fixed value of k). A much more powerful bou