GMAT Question of the Day

N is an integer greater than 6, which of the following must be divisible by 3?

The choices are n(n+5)(n-3), n(n+2)(n+5), n(n+1)(n-4) , n(n+1)(n-2), and so on.

← Next post Previous post →

Subscribe / Share

Take GMAT Team tagged this post with: GMAT Quantitative Descrete Questions, GMAT Question of the Day Read 1234 articles by Take GMAT Team

1. Nrip Nihalani says:

   August 9, 2007 at 1:42 pm

   n(n+1)(n-4)
2. kv says:

   August 9, 2007 at 1:45 pm

   3rd
3. AP says:

   August 11, 2007 at 9:43 am

   n(n+1)(n-4)
4. Ganesh says:

   August 19, 2007 at 10:11 am

   plz explain!!!
5. charan says:

   August 16, 2010 at 4:44 pm

   sum of the digits for n(n+1)(n-4) is 3n-3 which is divisible by 3
6. ramesh says:

   August 17, 2010 at 6:37 am

   n(n+1)(n-4)
7. Anurag Garg says:

   August 17, 2010 at 10:57 am

   n(n+1)(n-4)
   More simplistically, substitute (7,8,9 & eliminate choices)
   Now there are three categories of nos.: n (define – divisible by 3), n+1, n+2
   (…and then again n+3 would be divisible by 3)

   In this choice, we’re covering all the ways that the calculated value of at least one of the components would be divisible by 3
   eg. if the nos. are as follows:
   n = n(n+1)(n-4) [n is divisible by 3]
   n+1 = (n+1)(n+2)(n-3) [n+3 is divisible by 3]
   n+2 = (n+2)(n+3)(n-2) [n+3 is divisible by 3]
8. Anurag Garg says:

   August 17, 2010 at 10:58 am

   n(n+1)(n-4)
   More simplistically, substitute (7,8,9 & eliminate choices)
   Now there are three categories of nos.: n (define – divisible by 3), n+1, n+2
   (…and then again n+3 would be divisible by 3)

   In this choice, we’re covering all the ways that the calculated value of at least one of the components would be divisible by 3
   eg. if the nos. are as follows:
   n = n(n+1)(n-4) [n is divisible by 3]
   n+1 = (n+1)(n+2)(n-3) [n-3 is divisible by 3]
   n+2 = (n+2)(n+3)(n-2) [n+3 is divisible by 3]