Find all positive integers n for which there exists a polynomial P(x)∈Z[x] such that for every positive integer m≥1, the numbers Pm(1),…,Pm(n) leave exactly ⌈n/2m⌉ distinct remainders when divided by n. (Here, Pm means P applied m times.)Proposed by Carl Schildkraut, USA algebrapolynomialceiling functionabstract algebra