𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithm for numbering the partitions of n into m parts

✍ Scribed by B. M. Zlotnik

Publisher
Springer US
Year
1976
Tongue
English
Weight
250 KB
Volume
12
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The 2-Adic Behavior of the Number of Par
The 2-Adic Behavior of the Number of Partitions into Distinct Parts
✍ Ken Ono; David Penniston πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 171 KB

Let Q(n) denote the number of partitions of an integer n into distinct parts. For positive integers j, the first author and B. Gordon proved that Q(n) is a multiple of 2 j for every non-negative integer n outside a set with density zero. Here we show that if i 0 (mod 2 j ), then In particular, Q(n)

Algorithms for analyzing the probability
Algorithms for analyzing the probability of M-out-of-N events
✍ F.Eric Haskin; George E. Radke Jr.; Javon Evanoff πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 816 KB

Simple algorithms are presented to compute both the exact probability of M or more out of N independent input events given unequal probabilities and, when there is uncertainty in the input event probabilities, the associated variance in the M-out-of-N probability. The performance of the M-out-of-N p

The crossing number of Cm Γ— Cn is as con
The crossing number of Cm Γ— Cn is as conjectured for n β‰₯ m(m + 1)
✍ Lev Yu. Glebsky; Gelasio Salazar πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 168 KB πŸ‘ 1 views

## Abstract It has been long conjectured that the crossing number of __C~m~__ × __C~n~__ is (__m__βˆ’2)__n__, for all __m__, __n__ such that __n__ β‰₯  __m__ β‰₯  3. In this paper, it is shown that if __n__ β‰₯  __m__(__m__ + 1) and __m__ β‰₯  3, then this conjecture holds. That is, the crossing number of __