Divisibility and Remainders: Quant Reasoning AMA

In this Ask-Me-Anything, Avi reasons through an official GMAT Divisibility problem.

0:00 Intro
0:16 If n is an integer greater than 6
27:40 Should you start with easier statement?
29:04 Look at answer choices ahead of time?


Follow me on Social Media:

[ashishsinha]

Thanks Avi for your out-of-box approach.

[cristina]

One of my favorite videos from your channel, thank you so much for your great work!

[aricoleman]

Great video

Super easy to implement

[soulreaperichig]

I have a doubt. I got that you eliminated B to E because they came from the same camp. But what about A. Aren't n and n-4 coming from the same camp? Both are odd or even?

[AkshatGupta-uicf]

Sir i can't understand why b is the answer. can you help me with this problem
If the prime numbers p and t are the only prime factors of the integer m, is m a multiple of p^2*t?

(1) m has more than 9 positive factors.
(2) m is a multiple of p^3

[alexeykormilitsyn]

Hi - is it not possible to see if the sum of the additives to n is divisible by 3? e.g. (n+1) & (n-4) -> (+1)+(-4) = 3 =OK and (n+1)(n+3) -> 1+3=4=Not OK; alternatively (n+4)(n+11) -> 4+11=15=OK etc. I'm curious to see if that's a shortcut to visualising& drawing the numberline