Let the numbers P = 2 0 0 8 2 0 0 7 − 2 0 0 8 , and Q = 2 0 0 8 2 + 2 0 0 9 .
What is the remainder when P is divided by Q ?
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.
Brilliant solution!!!! Thank YOU!
Same way! Was starting to wonder how everyone else did it...
Brilliant and awesome solution! Waiting for the next ball. Thanks.
2 0 0 8 3 = ( 2 0 0 8 2 + 2 0 0 9 ) + 1 2 0 0 8 2 0 0 7 = K × ( 2 0 0 8 2 + 2 0 0 9 ) + 1 R e s = 2 0 0 8 2 + 2 0 0 9 − 2 0 0 7 = 4 0 3 2 0 6 6
2 0 0 8 3 = ( 2 0 0 8 2 + 2 0 0 9 ) + 1 . You meant 2 0 0 8 3 = 2 0 0 7 ( 2 0 0 8 2 + 2 0 0 9 ) + 1
2008^3 is not equal to (2008^2 + 2009) + 1.....
Log in to reply
A senseless stupid mistake done by the solution writer and still it has 6 upvotes ! I feel spooky...
Log in to reply
Hey ! @Aditya Raut -Atleast this solution is okay! Look at Anik mANDal's 100% INCORRECT solution to Daniel Lim's problem- Do ya know the identity to solve this? -He also has 10 upvotes :( So bad!!
Let x = 2 0 0 8 . Note that since 2 0 0 7 is divisible by 3 , x 2 0 0 7 − 1 is divisible by x 3 − 1 , so for some polynomial P ( x ) with integer coefficients we have x 2 + x + 1 x 2 0 0 7 − x = x 2 + x + 1 x 2 0 0 7 − 1 + x 2 + x + 1 1 − x = x 2 + x + 1 ( x 3 − 1 ) P ( x ) + x 2 + x + 1 1 − x = ( x − 1 ) P ( x ) + x 2 + x + 1 1 − x . The first term is necessarily an integer, so the remainder is just 1 − x = − 2 0 0 7 ≡ 2 0 0 8 2 + 2 ≡ 4 0 3 2 0 6 6 ( m o d 2 0 0 8 2 + 2 0 0 9 ) .
Let x = 2008
x^2007 - x
= x^2007 + x^2006 + x^2005 - x^2006 - x^2005 - x
= x^2005 (x^2 + x + 1) - (x^2006 + x^2005 + x^2004) + x^2004 - x
= x^2005 (x^2 + x + 1) - x^2004 (x^2 + x + 1) + x^2004 - x
--> x^2004 - x
--> x^(3n + 0) - x {2007/ 3 = 669 and 2004/ 3 = 668}
--> 1 - x or x^3 - x
Simplified positive numbers = (x3 - x)/ (x2 + x + 1) = x (x2 - 1)/ (x2 + x + 1)
= 2008 * 4032063/4034073
= 8096382504/ 4034073
Remainder = MOD(8096382504, 4034073) = 4032066
Problem Loading...
Note Loading...
Set Loading...
Making x = 2 0 0 8 . So P = x 2 0 0 7 − x and Q = x 2 + x + 1 . Thus, we have to solve x 2 0 0 7 − x ( m o d x 2 + x + 1 ) . How x 2 + x + 1 ≡ 0 ( m o d x 2 + x + 1 ) ⇒ x 2 ≡ − ( x + 1 ) ( m o d x 2 + x + 1 ) ⇒ ( x 2 ) 2 ≡ ( − ( x + 1 ) ) 2 ( m o d x 2 + x + 1 ) ⇒ x 4 ≡ x 2 + 2 x + 1 = x 2 + x + 1 + x ≡ x ( m o d x 2 + x + 1 ) . That is, x 4 ≡ x ( m o d x 2 + x + 1 ) and g c d ( x , x 2 + x + 1 ) = 1 ⇒ x 3 ≡ 1 ( m o d x 2 + x + 1 ) ⇒ x 2 0 0 7 ≡ 1 ( m o d x 2 + x + 1 ) ⇒ x 2 0 0 7 − x ≡ 1 − x ( m o d x 2 + x + 1 ) . Therefore, 2 0 0 8 2 0 0 7 − 2 0 0 8 ≡ 1 − 2 0 0 8 = − 2 0 0 7 ( m o d 2 0 0 8 2 + 2 0 0 9 ) . How 2 0 0 8 2 + 2 0 0 9 = 4 0 3 4 0 7 3 , so 2 0 0 8 2 0 0 7 − 2 0 0 8 ≡ − 2 0 0 7 ≡ 4 0 3 4 0 7 3 − 2 0 0 7 = 4 0 3 2 0 6 6 ( m o d 2 0 0 8 2 + 2 0 0 9 ) .