Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am going through a paper, and theres one point in the proof I've been having problems understanding.

We have $\alpha \in G$ with minimal polynomial $h$, where $G$ is the algebraic closure of a field $F$, a finite field of prime order $q$. Also take $[F(\alpha):F]=d$, and take $P_q(n)$ as the set of all monic polynomials over the field of order $q$ of order $n$. We have $1\leq k<q$.

I'm having problems showing that: $$[ \prod_{i=1}^n(x-x^{q^i})]^k \cdot \sum_{f\in P_q(n), h \nmid f}\frac{1}{f^k} \equiv 0 \pmod {(x-\alpha)^{k\lfloor \frac{n}{d} \rfloor}}$$

share|cite|improve this question
The algebraic closure of a field is always infinite. Since $F$ is finite, we will have $[G:F]=\infty$ – Dennis Gulko Oct 23 '12 at 15:55
What is $k$? An arbitrary integer? – Thomas Andrews Oct 23 '12 at 16:11
Any what is $n$, another arbitrary integer? By the way the $n$ in $P_q(n)$ is probably meant to do something; is it the degree of the monic polynomials? – Marc van Leeuwen Oct 23 '12 at 16:19
What paper is it? This might help us – Alexander Gruber Oct 23 '12 at 16:39
Fixed some things that should answer some questions. Also, the title of the paper is "Sums of REciprocals of Polynomials over Finite Fields" by Kenneth Hicks, Xiang-dong Hou, and Gary L. Mullen. – Frank White Oct 23 '12 at 16:59

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.