pratk
I also got 2,5,7,11 and 13 but it took me more than the two minutes to break down 143 into 11 and 13. 2,5 and 7 were the easier ones. I'm sure many will agree at in times of stress, the mind starts to play tricks. At first I stopped after 7 and thought that 143 cannot be factored further and chose C as the answer i.e. 3 prime factors but then got the other two in over the two mins.
Therefore, is there a quick way to get the prime factors of a large number?
Thanks.
Generally there is no easy way to check whether some very large number is a prime (well if it doesn't have some small primes, which are easy to check). You'll need a computer to do this.
Next, the GMAT won't give you a large number to factorize if there is no shortcut for that.
For example in our original question after you find 2, 5, and 7, just check for the next prime 11: 143/11=13.
You can also use divisibility rule for 11: if you sum every second digit and then subtract all other digits and the answer is divisible by 11, then the number is divisible by 11. So, for 143: (1+3)-4=0 --> 0 is divisible by 11 thus 143 is divisible by 11.
Or, you can notice that 143=130+13=
13*10+
13, so 143 must be divisible by 13.
So, as you can see there are plenty of shortcuts to get prime factorization of the numbers from the GMAT problems.
For more on divisibility rules and on verifying the primality check Number Theory chapter of Math Book:
math-number-theory-88376.htmlHope it helps.