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}...
-
I'm just learning how to test series for convergence and have encountered this series from the Demidovich's book and I can't rea...
-
Ok, according to some notes I have, the following is true for a random variable $X$ that can only take on positive values, i.e $P(X $\int_0^...
-
Make a bijection that shows $|\mathbb C| = |\mathbb R| $ First I thought of dividing the complex numbers in the real parts and the c...
No comments:
Post a Comment