Find the remainder when 2 0 1 2 × 2 0 1 3 × 2 0 1 4 is divided by 2 0 1 1 .
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.
Can you tell me from which site I can learn mod that you have used in your anwer
Log in to reply
You can search this topic in "Congruence Theory".
Let n=2011 [(n+1)(n+2)(n+3)]/n simply +1+2+3=6 :)
Let 2011=x , than we have to find remainder when (x+1)×(x+2)×(x+3) is divided by x ,when me multiply it each term will contain x and hence divisible by 2011 but the last term 6 is not divisible and the remainder. No knowledge of mod required in this way
We have ( a + 1 ) ( a + 2 ) ( a + 3 ) ≡ b ( m o d a ) . Upon expansion, every term on the LHS is clearly will be divisible by a. Thus we only need the last term: 6. And that is our remainder.
When we divide 2012 with 2011, the remainder is 1.when 2013 is divided by 2011, the remainder is 2.And when 2011 divides 2014, the remainder is 3.
Therefore the remainder when 2011 divides 2012 x 2013 x 2014 is 1+2+3=6.
No .. that clearly is the wrong approach, because if you keep going, you would get that the remainder of 2012x2013x2014x2015 divided by 2011 is 10, when the correct answer is 24. 2012=2011+1, so let 2011=x and write (x+1)(x+2)(x+3)(x+4) .. if you cross multiply, the only term that will not be divisible by x is the last one, which will be 1 2 3*4=24.
add 1,2,3 to 2011 to get 2012,2013,2014 and by adding 1,2,3 we get 6 which is the remainder
Problem Loading...
Note Loading...
Set Loading...
2012 x 2013 x 2014 is congurent to 1 x 2 x 3 (mod 2011)= 6 (mod 2011)