how would you prove that there exists no $k \in \Bbb{N}$ such that for all
$x\in\Bbb{Z}$ the integer $x^2-x+k$ divides $x^{135}+x+2016$? I started off with contradiction by assuming that there exists a k such that $x^2-x+k$ divides $x^{135}+x+2016$
then $(x^2-x+k)r=x^{135}+x+2016$ for some $r \in \Bbb{Z}$ but from this point im finding it really hard to draw a contradiction.
Wednesday, 6 November 2013
algebra precalculus - prove that there is no k such that $x^2-x+k$ divides $x^{135}+x+2016$
Subscribe to:
Post Comments (Atom)
real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$
How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
$$ 3x+6y+5z=7 $$ The general solution to this linear Diophantine equation is as described here (Page 7-8) is: $$ x = 5k+2l+14 $$ $$ y = -l $...
-
I need help to compute the following integral: $$\int_{-\infty}^{\infty}\frac{z^4}{1+z^8}dz$$ I need to use Cauchy's residue theorem. I ...
No comments:
Post a Comment