Abhishek009
Bunuel
If n is an integer greater than 7, which of the following must be divisible by 3?
(A) n(n-5)(n-2)
(B) n(n+5)(n+3)
(C) n(n+2)(n-1)
(D) n(n-4)(n-2)
(E) n(n-7)(n+3)
Rule of divisibility states that a number is divisible by 3 if the sum of the digits is divisible by 3 , check for the same in the answer choices -(A) n(n-5)(n-2)
=> n + (n-5) + (n-2) = 3n - 7 { Not divisible by 3 }
(B) n(n+5)(n+3)
=> n + (n+5) + (n+3) = 3n + 8 { Not divisible by 3 }
(C) n(n+2)(n-1)
=> n + (n+2) + (n-1) = 3n + 1 { Not divisible by 3 }(D) n(n-4)(n-2)
=> n + (n-4) + (n-2) = 3n - 6 {Divisible by 3 }
(E) n(n-7)(n+3)
=> n + (n-7) + (n+3) = 3n - 4 { Not divisible by 3 }
Hence correct answer will be (D)Hi Abhishek009
We can't use that approach in such type of questions.
First of all, adding those multiples won't give you sum of digits of the final product.
Consider the following case:
n(n + 6)(n - 3)
If we add we'll get: n + n + 6 + n - 3 = 3n + 3 = 3(n + 1). At first glance seems to be multiple of 3 but let's pick some number, say n=5
5 + 5 + 6 + 5 - 3 = 18 clearly divisible by 3, but actual product: 5*11*2 is not.
The problem is when we divide our product n(n + 6)(n - 3) by 3, our remainder will be defined by n^3/3 (6 and 3 will give us 0 as a remainder). So the question boils down to the fact: if n itself is a multiple of 3 or not, n+6 and n-3 won't give us any additional information to answer it.
In that particular question it was just a coincidence that we get right answer, in general - we won't. I think checking remainders is the most appropriate way to tackle such type of problems.
Hope that's clear.
Regards
Vitaliy