A Bound for the Number of Multiplicative Partitions
From MaRDI portal
Publication:3735773
Zwei Faktorzerlegungen einer Zahl \(1<n\in\mathbb N\) (in Faktoren \(>1\)) heißen wesentlich verschieden, wenn sie sich nicht nur in der Reihenfolge der Faktoren unterscheiden. Ist \(f(n)\) die Anzahl der wesentlich verschiedenen Faktorzerlegungen von \(n\), so zeigen Verff. \(f(n)\leq n\).
Recommendations
Cited in
(16)- Simple upper bounds for partition functions
- Estimating the number of multiplicative partitions
- A double bounded version of Schur's partition theorem
- Investigation of norms of overpartitions
- scientific article; zbMATH DE number 4179475 (Why is no real title available?)
- scientific article; zbMATH DE number 5633592 (Why is no real title available?)
- scientific article; zbMATH DE number 4012712 (Why is no real title available?)
- New upper bounds for the number of partitions into a given number of parts
- scientific article; zbMATH DE number 1214999 (Why is no real title available?)
- Asymptotic bounds for factorizations into distinct parts
- On the number of arithmetic formulas
- Subgroups of solvable groups with non-zero Möbius function
- Intersections of maximal subgroups in prosolvable groups
- A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
- An explicit bound for the number of partitions into roots
- On a theorem of Erdős and Loxton
This page was built for publication: A Bound for the Number of Multiplicative Partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735773)