Monotonicity conjecture for the binomial-logarithm sequence

Let cpc_p and wpw_p be the quantities defined by

cp=1pk=1p(1)k(pk)lnk,wp=1pk=1p(pk)(1)k(lnk)2.c_{p}=-\frac{1}{p}\sum_{k=1}^{p}(-1)^{k}\binom{p}{k}\ln k,\qquad w_{p}=-\frac{1}{p}\sum_{k=1}^{p}\binom{p}{k}(-1)^{k}\left(\ln k\right)^{2}.

Define the sequence

ap:=π26+pwpp2cp2.a_p:=\frac{\pi^{2}}{6}+p w_p-p^{2}c_p^{2}.

Monotonicity conjecture. The sequence apa_p is decreasing in pp. The preceding asymptotic result gives ap0a_p\to 0 as pp\to\infty, so this conjecture would describe the finite-pp approach to the limiting constant π2/6\pi^2/6.

Sources & referencesView supporting material

Primary source

Aristides V. Doumas, “On the minimum of independent collecting processes via the Stirling numbers of the second kind”, arXiv:2202.03713 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.