1

Prove that the following congruence has no solution on $\mathbb{Z}$

$$x+x^{3}+x^{5}+x^{7}+x^{9}+x^{11}\equiv 1\mod{11}$$

It is giving me hard times, some hints about it? Thank you

F.inc
  • 1,133

2 Answers2

2

Hint:

Write $ x+x^{3}+x^{5}+x^{7}+x^{9}+x^{11} = x(1+x^{2}+x^{4}+x^{6}+x^{8}+x^{10}) $.

Set $y=x^2$ and find the second sum using Fermat's theorem.

lhf
  • 216,483
1

It's a well known formula that $x^n-1=(x-1)(x^{n-1}+...+1)$. Therefore, we have that the LHS is $$x(x^{12}-1)=(x-1)x(x+1)$$ Where we have used Fermat's Little Theorem to conclude $x^{11}=x$. For the product of three consecutive integers to be $1$, we must have none of them to be a multiple of $11$, which eliminates some cases. The remaining are easy to check.

YiFan Tey
  • 17,431
  • 4
  • 28
  • 66