Consider the set of odd partitions of n. As n grows, what is the proportion which have at least as many parts of size 1 as distinct parts?
I'm not a combinatorialist, but this seems potentially within the wheelhouse of the right people(?).
$\begingroup$ $\endgroup$
1 
New contributor
arkantos is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
- 1$\begingroup$ Cross-posted: math.stackexchange.com/questions/5106949/… $\endgroup$RobPratt– RobPratt2025-11-05 03:24:32 +00:00Commented Nov 5 at 3:24
Add a comment |