General irreducibility conjecture for integer polynomials with prime-power constant term
General irreducibility conjecture for integer polynomials with prime-power constant term
From papers
Let and be prime numbers, let , and let
Irreducibility conjecture. If , , and
then is irreducible over . This conjecture seeks a common irreducibility criterion extending the preceding results for the cases , , and ; its resolution is not given here.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Zhang Weilin and Yuan Pingzhi, “A note on an irreducible class of polynomials over integers”, arXiv:2303.03605 (2023).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.