Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-26T13:03:11.758Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Number of Partitions of { 1, …, n} into Two Sets of Equal Cardinalities and Equal Sums

Published online by Cambridge University Press:  20 November 2018

Helmut Prodinger
Helmut Prodinger*
Affiliation:
Institut Für Mathematische Logik und Formale Sprachen, TU Wlen 1040 Wien Guβhausstraβe 27-29, Austria
Rights & Permissions [Opens in a new window]

Abstract

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.

Let A(n) be the number of partitions of { 1 , … , n} into two sets A, B of cardinality n/2 such that . Then there is the asymptotic result

Keywords

05A17
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 25 , Issue 2 , 01 June 1982 , pp. 238 - 241
Copyright
Copyright © Canadian Mathematical Society 1982

References

1. van Lint, J. H., Representations of 0 as σk=-N N ɛkk, Proc. A.M.S. 18 (1967), 182-184.Google Scholar
2. Uspensky, J. V., "Introduction to Mathematical Probability", McGraw-Hill, New York (1937).Google Scholar