Quant Flashcards
(132 cards)
When I do smart numbers
I’ll avoid weird numbers like 0, 1 and fractions and the numbers in the problem
If I want to check divisibility by 9
I check to see if sum of digits is divisible by 9
What are the first 5 prime numbers?
2,3,5,7,11
What are the 6th to 10th prime numbers
13, 17, 19, 23 ,29
If I want to check divisibility by 8
I can divide by 2 three times
or
I can check if the last 3 digits are divisible by 8
If I want to check divisibility by 6
I need to make sure it’s divisible by 2 & 3
If I want to check divisibility by 4
I can divide by 2 twice
or
I can check if the last 2 digits are divisible by 4
If I want to know if a # is divisible by 3
I sum the digits of the number (Integers only) and check if it’s divisible
If N is a divisor of X & Y
Then N is a divisor of X + Y
When checking divisibility of a large number by another large number
I can check if it’s divisible by a factor pair of the divisor
ex 6750 div by 18
6750/2 works
and
6750/9 works
2*9=18 so it works
√ 2
approx 1.4
√ 3
Approx 1.7
11^2
121
13^2
169
14^2
196
15^2
225
16^2
256
25^2
625
4^3
64
5^3
125
10^3
1000
It is a zero per power
When do you Test Cases in Problem Solving?
You use it when the problem asks a must be or could be question
When do you Test Cases in Data sufficiency
Use it when several unknowns and it’s a Y/N question
x^2 - y^2=
(x+y) (x-y)