Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-22T10:15:07.366Z Has data issue: false hasContentIssue false
  • English
  • Français

Application of Combinatorial Formulae to Generalizations of Wilson's Theorem

Published online by Cambridge University Press:  20 November 2018

N. S. Mendelsohn
N. S. Mendelsohn*
Affiliation:
University of Manitoba
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Summary. By the use of finite difference operators a series of combinatorial formulae are obtained. Two applications of the formulae are given. First, the following explicit formulae for the number, ƒ(n), of non-isomorphic equivalence relations among n elements are obtained:

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 1 , Issue 4 , 01 August 1949 , pp. 328 - 336
Copyright
Copyright © Canadian Mathematical Society 1949

References

[1] Geirenger, H., Ann. Math. Statist., vol. 9 (1938), 262.Google Scholar
[2] Kaplansky, I., “On a Generalization of the ‘Problème des Rencontres', ” Amer. Math. Monthly, vol. 46 (1939), 159-161.Google Scholar
[3] Kaplansky, I., “Symbolic Solution of Certain Problems in Permutations,” Bull. Amer. Math. Soc, vol. 50 (1944), 906-914.Google Scholar
[4] Mendelsohn, N. S., “Symbolic Solution of Card Matching Problems,” Bull. Amer. Math. Soc, vol. 52 (1946), 918–924.Google Scholar