The minimal-polynomial degree conjecture for recursive sequences modulo prime powers

About 11 years old · traced to

Let pp be prime and let pγp^\gamma, with γ≥1\gamma\ge1, be a modulus. A minimal polynomial is a polynomial of least degree giving the relevant recursive-sequence relation modulo pγp^\gamma. Minimal-polynomial degree conjecture. The degree of a minimal polynomial for the modulus pγp^\gamma is the least dd such that

vp(d!)≥γ.v_p(d!)\ge\gamma.

This conjecture is proposed from the minimal-polynomial calculations for the moduli p,p2,…,pp+1p,p^2,\ldots,p^{p+1}. The source gives no resolution or further evidence for its status.

References

Primary source

Christian Krattenthaler and Thomas W. Müller, “A method for determining the mod-p^k behaviour of recursive sequences”, arXiv:1508.02580 (2025).

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.