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

If $a(x) + b(x) = x^6-1$ and $\gcd(a(x),b(x))=x+1$ then find a pair of polynomials of $a(x)$,$b(x)$.

Prove or disprove, if there exists more than 1 more distinct values of the polynomials.

share|cite|improve this question
Hint: What do you get if you divide $x^6-1$ by $x+1$? – Aleks Vlasev Oct 16 '12 at 6:35
I've removed algebra tag, since we don't use algebra tag anymore, see meta for details. – Martin Sleziak Oct 19 '12 at 13:56
up vote 2 down vote accepted

There is too much freedom. Let $a(x)=x+1$ and $b(x)=(x^6-1)-(x+1)$. Or else use $a(x)=k(x+1)$, $b(x)=x^6-1-k(x+1)$, where $k$ is any non-zero integer.

share|cite|improve this answer
Thank you.I don't what i was thinking :p – Sai Krishna Deep Oct 16 '12 at 7:08

Since $\gcd\{a(x),b(x)\}=x+1$, there are polynomials $p(x)$ and $q(x)$ such that $a(x)=(x+1)p(x)$ and $b(x)=(x+1)q(x)$.




You can easily find several pairs of relatively prime polynomials $p(x)$ and $q(x)$ that satisfy $(1)$, and they give you pairs $a(x),b(x)$.

share|cite|improve this answer
You just have to make sure that $\gcd(p,q)=1$. For example, let $p(x)=x^k$. – Hagen von Eitzen Oct 16 '12 at 8:35

Hint $\ \ $ If $\rm\:a\!+\!b = c\:(x\!+\!1)\:$ then

$$\rm\:x\!+\!1 = (a,b) = (a,c\,(x\!+\!1)\!-\!a) = (a,c\,(x\!+\!1))\iff a = d(x\!+\!1),\,\ (d,c) = 1$$

Thus for $\rm\:c(x\!+\!1) = x^6\!-\!1\:$ it's true $\rm\iff a = d(x\!+\!1),\:$ for $\rm\,d\,$ coprime to $\rm\:c = (x^6\!-\!1)/(x+1),\:$ or, equivalently, $\rm\,d\,$ coprime to $\rm\:x\!-\!1,\ x^2\pm x + 1$

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.