The value of k = 1 ∑ 1 0 0 0 k 4 + k 2 + 1 k
can be expressed in the form n m , where m and n are coprime positive integers. Find m + n .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I thought a lot if 500500 and 1001001 are coprime or not ?!!! :)
Log in to reply
It can be easily seen that 1 0 0 1 0 0 1 = 2 ⋅ 5 0 0 5 0 0 + 1 so they're of course coprime.
Factorising 1001001 = 3 × 3 3 3 6 6 7
And
500500 = 2 2 × 5 3 × 7 × 1 1 × 1 3
Hence they are co-prime
1 0 0 1 0 0 1 − 2 ⋅ 5 0 0 5 0 0 = 1 0 0 1 0 0 1 − 1 0 0 1 0 0 0 = 1 and hence they are coprime.
Please note that (k+1)^2-(k+1)+1 is actually equal to k^2+k+1 :)
guys pls suggest me some books to improve logical reasoning
This is exactly what I did!
Dude, how do you factorise the k/(k^4+k^2+1)?
Log in to reply
write k^4+k^2+1 = (k^2 + 1)^2 - (k^2) which is a difference of two squares
Problem Loading...
Note Loading...
Set Loading...
Sorry for my wrong solution I just forgot to multiply by 2 1
Here
k 4 + k 2 + 1 = ( k 2 − k + 1 ) ( k 2 + k + 1 )
Rewriting it we get
k = 1 ∑ 1 0 0 0 2 1 ( k 2 − k + 1 1 − k 2 + k + 1 1 )
When we will put the values of k all the terms will cancel out except first and last terms.
Finally we get
2 1 ( 1 − 1 0 0 1 0 0 1 1 ) = 1 0 0 1 0 0 1 5 0 0 5 0 0
Hence
5 0 0 5 0 0 + 1 0 0 1 0 0 1 = 1 5 0 1 5 0 1