𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomials and packings: A new proof of de Bruijn's theorem

✍ Scribed by Paul Boisen


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
119 KB
Volume
146
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


In 1969 de Bruijn published a proof of the following fact: An a x ab x abc brick can be used to pack an A x B x C box if, and only if, the integers A, B, C are in some order a multiple of a, a multiple of ab, and a multiple of abc. We give a quick proof of this result based on the following elementary lemma. The polynomial (x a-1)(x ab-1)(x Β°be-1) divides (x A -1)(x B-1)(x c -1) if, and only if, the integers A, B, C are in some order a multiple of a, a multiple of ab, and a multiple of abc.

Compare the following two results, in which a, b, c, A, B, C denote positive integers.


πŸ“œ SIMILAR VOLUMES


On a theorem of de Bruijn and ErdΓΆs
✍ David J. Houck; Michael E. Paul πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 430 KB
A new proof of menger's theorem
✍ Peter V. O'Neil πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 134 KB πŸ‘ 1 views

## Abstract A new proof of Menger's theorem is presented.

A New Proof of Monjardet's Median Theore
✍ D.E. Loeb πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 354 KB

New proofs are given for Monjardet's theorem that all strong simple games (i.e., ipsodual elements of the free distributive lattice) can be generated by the median operation. Tighter limits are placed on the number of iterations necessary. Comparison is drawn with the / function which also generates