Statistical properties of partitions
This paper contains some personal memories of Paul Erdős' visits in France and the author's collaboration with him. It is devoted to some of Erdős' favorite number-theoretic problems. The author presents their history and development. The paper is divided into five sections. Section 2 considers the problem concerning the largest size of the sequence \(1\leq a_1<a_2<\dots<a_k\leq n\) such that \(a_i+a_j\) is never a square for all \(1\leq i\leq j\leq k\). Section 3 is devoted to applications of the sieve method. In Section 4, the Erdős-Lehner limit theorem on the number of partitions of the positive integer \(n\) with at most \(m\) parts is discussed. Section 5 considers Erdős' role in the study of practical partitions of \(n\), i.e. partitions that represent all integers between \(0\) and \(n\). For the entire collection see [Zbl 0999.00015].
This page was built for publication: Statistical properties of partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410064)
