Polynomization of Sun's Conjecture
Let $p(n)$ denote the number of partitions of a natural number $n$. As $ n \to \infty$, the $n$th root of $p(n)$ tends to $1$, which is related to the Cauchy--Hadamard test for power series. Andrews also discovered an elementary proof. Sun conjectured that this happens in a certain way for $n\geq 6$: \begin{equation*} \sqrt[n]{p(n)} >...