Equidistribution conjecture for roots of partition numbers

Less than 1 year old · traced to

For each positive integer nn, let p(n)p(n) denote the partition function, and let {r}\{r\} denote the fractional part of a real number rr. The equidistribution conjecture. For each fixed integer k≥2k\geq 2, the sequence

{{p(n)k}}n≥1\left\{\left\{\sqrt[k]{p(n)}\right\}\right\}_{n\geq 1}

is equidistributed in [0,1)[0,1). The source presents strong supporting computational evidence, but no proof is given.

References

Primary source

Summer Haag, Praneel Samanta, Swati, Holly Swisher, Stephanie Treneer and Robin Visser, “Repellent properties of perfect powers on partition functions: a heuristic approach”, arXiv:2601.18138 (2026).

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.