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 have to show that the polynomial $$f(x)=\frac{x^{n}+x^{m}-2}{x^{\gcd(n,m)}-1}$$ is irreducible over $\mathbb{Q}$, for all $n,m \in \mathbb{N}$. Any idea as to how I can show this.

share|cite|improve this question
Here is a generalization:… And here is a useful lemma: – Beni Bogosel Oct 24 '12 at 7:00

Hint: Say that $gcd(n,m)=d$, and write $f(x) = \dfrac{x^n+x^m-2}{x^d-1}$ as

$$f(x) = x^{(c-1)d}+x^{(c-2)d} + \cdots x^{bd}+2x^{(b-1)d)}+ \cdots +2x^d +2$$ where $n = cd$, $m=bd$. Consider the polynomial $g(x) = x^{c-1} + \cdots + x^b +2x^{b-1}+ \cdots +2x + 2 $. Show that this polynomial only has roots of absolute value greater than 1. Use this to show that the roots of f satisfies a similar property, and derive a contradiction.

share|cite|improve this answer

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.