Answers are grounded in this paper and cite their sources.
Let pₖ(n) denote the number of partitions of n with no part divisible by k. We prove the conjecture of Heim and Neuhauser that pₖ(n) is log-concave at every n ≥ 26 for each k ≥ 30. More precisely, the minimum of the normalized Turán difference n^(3/2) [1 − pₖ(n−1)pₖ(n+1)/pₖ(n)²] over k ≥ 30 and n ≥ 26 is 3553 · 29√29 / 4565². Equality holds precisely when n = 29 and k ≥ 31. For each k ≥ 30, the exceptions to log-concavity are exactly the odd integers from 1 to 25. The proof uses Euler’s pentagonal number theorem to compare weighted second differences with those of the ordinary partition function, and a uniform saddle-point estimate for the large-index range.
No takes yet. Share an insight, caveat, or question.
haoyuan Wu (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: