Let $K$ be a degree $n$ extension of ${\mathbb Q}$ with ring of integers $R$. An order in $K$ is a subring with identity of $R$ which is a ${\mathbb Z}$-module of rank $n$.

Question: Let $p$ be an unramified prime in $K$. Is it true that the number of orders in $R$ of index equal to $p^r$, for some natural number $r$, is less than or equal to the number of subrings with identity of ${\mathbb Z}^n$ of index equal to $p^r$?

Nathan Kaplan and I need this fact for $n=5$ in a project where we are trying to find asymptotic formulae for the number of orders of bounded index in a given quintic field.

We've been staring at Jos Brakenhoff's thesis for a while, but I haven't gotten anywhere. Any advice will be greatly appreciated. Thanks.

Added in edit: Here is an elementary reformulation of this problem. Let $r(x)$ be a polynomial with integer coefficients. Then show that for any natural number $a$ in order to maximize the number of subrings of $({\mathbb Z}/p^a {\mathbb Z})[x]/(r(x))$ of a given index, the polynomial $r(x)$ has to be a product of linear factors modulo $p$.

Update: In a soon-to-be-posted preprint Nathan Kaplan, Jake Marcinek, and I have proved an asymptotic formula for the number of orders in a given quintic field of bounded discriminant, using an argument independent of the above question. We can also give non-trivial upper bounds for a general number field. I'm now convinced the answer to the question is yes, but I still don't know how to prove it.