The expected number of parts in a partition of n

DOI10.1007/BF01303193zbMATH Open0331.10026MaRDI QIDQ1227770FDOQ1227770

K. Appert

Publication date: 1976

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/177752

Mathematics Subject Classification ID

Elementary theory of partitions (11P81)

Cites Work

• A simplified proof of the partition formula
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Approximation Algorithms for Three Dimensional Protein Folding
• A General Asymptotic Scheme for the Analysis of Partition Statistics
• Partitions and the maximal excludant
• Integer partitions, probabilities and quantum modular forms
• A class of trees and its Wiener index

This page was built for publication: The expected number of parts in a partition of n

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1227770)