MATH
MATH
MATH
4 NP. Various
5 NP. Powers-Roots
6 NP. Multiples
7 NP. DIVISIBILITY TESTS
8 NP. Primes
9 NP. RECURRING DECIMALS
10 NP. Calc shortcuts
11 NP. Digits
12 G. Pythagorean Triples
13 G. Circles & Triangles
14 G. Triangles & Others
15 G. Solids
16 G. Circles-Squares (Pi)
17 Equations, Algebra
18 WT. Probability-Combinatorics
19 WT. Statistics
20 FDP
21 Strategies
MAN WORD TRANSLATIONS - SUMMARY
A) ALGEBRAIC TRANSLATIONS
1) Assign variables, write equations, solve
2) Use charts to organize variables
C) RATIOS
. if you have the weighted average and both endpoints, then you also have the RATIO of the weights, which is the
eg: 10%x +2%y=5%z only need one value to solve, as x/y = (dist y)/(dist x) = (5-2) / (10-5) = 3/5
D) COMBINATORICS
1) Simple factorials
2) Anagrams
Represent situations in which the order does not matter with repeated letters in your combinatorics grid. Then divid
eg: ways to arrange 7 different letters in 7 different positions -> 7! ... = arrange ABCDEFG in 1234567 = 5040
eg: ways to arrange 7 different letters in 4 different positions -> 7! / 3! = 7P4 = 7C4 * 4! = 7! / (7-4)! … = arrange AB
eg: ways to pick 4 letters from 7 different letters (order does not matter) -> pick from ABCDEFG, put as YYYYNNN
3) Combinatorics with constraints - 2 methods explained through examples - pages 52 & 53
4) Valuable exercises from the book
#1 - In how many different ways can the letters in the word "LEVEL" be arranged -> 5!/(2!*2!)
#2 - How many boxes with 2 different truffles can be made from 5 different kinds truffles (unlimited quantity for each
#3 - With digits 1-5, how many different jerseys with two-digit numbers can be made such that no player has a num
#4 - 4 different ingredients; how many bins are needed to hold every possible blend, given that each blend must ha
#7 - The lock requires to enter one number, from 1-9, and then push a pair of colored buttons (6 colors) simultaneo
#11 - Casey walks 9 blocks from home to work; school is 5 blocks down and 4 blocks left; how many different route
#14 - 3 dwarves and 3 elves; 6 chairs; dwarves and elves wont sit next to each other; how many different arrangem
#15 - distribute 5 dolls (2xS,1xE,1xJ,1xT) to 5 nieces, given that the yougest one does not want J -> 5!/2! - 4!/2! (al
E) PROBABILITY
1) P(A) & P(B) = P(A) x P(B)
2) P(A) OR P(B) = P(A) + P(B) (minus P(A&B) if events not independent -> not often tested on probability problems)
3) The 1-x probability trick
4) The domino effect
5) Tough probability -> list the winning scenarios
. Find probability of each scenario and add
. Find the number of winning scenarios and divide by the numer of outcomes (= counting method using combinator
eg: 6 girls, including K and A - pick 4 - probability that both K and A will be selected? -> 4C2/6C4
6) Valuable exercises from the book
#10 - have 2a, 3b and 4p; select 2 randomly - probability that the 2 will not be the same? -> a) (2C1*3C1+2C1*4C1
#11 - have 40c, 12t, 28v, 20s; A will pick 1 and B will pick 1 but different than A's - probability that one of them is c o
#15 - L,M,N,O,P sit randomly in a row; proabability that O and P are not next to each other? -> 1 - 4!*2!/5!
F) STATISTICS
1) Mean = total of quantities / number of quantities
2) Median = the "middle" number in a group
3) Standard deviation: measure of how far data points fall from the mean
Long method: 1-find the mean; 2-for each term, calculate deviation from the mean; 3-square the differences; 4-avg
Short method: square root of (average of the squares - square of the average).
G) OVERLAPPING SETS
1) Double-set matrix
2) 3-set problems -> venn diagram -> work from the inside out
Total = A + B + C - (AB+AC+BC) + ABC + N (where AB= intersection of A&B including the part shared with C)
Total = A + B + C - (AB''+AC''+BC'') - 2*ABC + N (where AB"= intersection of A&B excluding the part shared with C
the weights, which is the reciprocal of the ratio of the distances between the endpoints and the weighted average.
= (5-2) / (10-5) = 3/5
binatorics grid. Then divide by the factorial of the number of the repeated letters to account for over-counting
G in 1234567 = 5040
7! / (7-4)! … = arrange ABCDEFG in 1234NNN = 840
DEFG, put as YYYYNNN -> anagram of the word YYYYNNN -> 7! / 4! x 3! = 7C4 = 7! / (7-4)! x 4! = 35
obability problems)
method using combinatorics)
ected? -> 4C2/6C4
are the differences; 4-avg squared differences; 5-calculate the square root of this average
st as the other.
MAN NUMBER PROPERTIES GUIDE - SUMMARY
D) CONSECUTIVE INTEGERS
1) Definition: Evenly Spaced sets -> Consecutive multiples -> consecutive integers
2) Properties of evenly spaced sets
. Arithmetic mean and median are equal
. Arithmetic mean and median = (1st term + last term) /2
. Sum of all elements equals the average times the number of items
. n = Number of Consecutive multiples: [(Last - First) / increment ]+ 1
. The average of an odd number of consecutive integers will always be an integer -> The sum will always be a mult
. The average of an even number of consecutive integers will never be an integer -> The sum will never be a multip
. The product of k consecutive integers is always divisible by k factorial (eg: 1x2x3 = 6; divisible by 3!)
E) EXPONENTS
1) Have two solutions (+/-) when the exponent is even
F) ROOTS
1) Have one solution when the root is even
2) Imperfect vs perfect squares -- more accurate estimates by combining coefficient with root (eg: 4sqrt(5) = sqrt(80) = 8.9
H) STRATEGIES for DS
1) Always factor algebraic expressions when possible
2) Testing numbers
. Value question -> try to find examples that yield multiple values
. Yes/no question -> try to find examples that yield a Maybe
3) Statements never contradict each other
=
o or NI
e or o or NI
NI
e or NI
r more constants. Algebra is easier. See "Equations, inequalities and VIC's" Man guide
ble by 24 if middle # (x) odd, or div by 4 if x even and div by 4
A) POLYGONS
1) Quadrilaterals
Parallelogram opposite sides and opposite angles are equal
Rectangle opposite sides and all angles (90) are equal --- d^2 = l^2+w^2
Rhombus all sides and opposite angles are equal
Square all sides and angles (90) are equal
Trapezoid one pair of opposite sides is parallel
Rhomboid (inc rhombus) adjacent sides and opposite angles are equal
2.a) Polygons and interior/exterior angles
(n-2) x 180 = sum of interior angles
Triangles=180
Quadrilateral=360
Pentagon=540 (regular pent: 540/5=108)
Hexagon=720 (regular hex: 720/6=120)
1 ext angle + 1 int angle = 180 (supplementary)
Sum of the exterior angles = 360 => measure of any external angle = 360/n
2.b) Hexagons can be cut into four triangles by three lines connecting corners
E) COORDINATE PLANE
1) Slope of a line = rise/run = y1-y2 / x1-x2
2) Intercepts: x-intercept: (x,0) // y-intercept: (0,y)
For two lines intersecting in a point: to know if the product of their slopes is +/- one needs to know the product of bo
3) From 2 points to a line: find slope, plug slope into equation, plug any set of coordinates, solve and find y-intercept -> plu
4) Distance between 2 points: Pythagoras: sqrt[(x1-x2)^2+(y1-y2)^2]
5) Quadrants: +/+=I, -/+=II, -/-=III, +/-=IV
6) Perpendicular Bisectors: it has the negative reciprocal slope of the line it bisects -> find slope, find mid-point of original l
7) Intersection of two lines
8) Function graphs and Quadratics
Quadratic -> parabola -> y=a x^2 + bx + c a>0: curve opens upward; a<0: curve opens downward
|a| large -> narrow curve; |a| small -> wide curve
Roots: [ - b +/- (b^2 - 4ac)^(0.5) ] / 2a b^2 - 4ac is called the discriminant
if>0 then two solutions for x; if<0 then no solutions for x; if=0 then one
Equation of a circle is (x - a)^2 + (y-b)^2 = r^2, where (a,b) is the center and r is the radius
s + 1 side (included side) // 3 sides
(3)/8 = (d^2)*sqrt(3)/8
find mid-point of original line, plug in, solve and find y-intercept -> plug into equation
http://gmatclub.com/forum/math-formula-and-shortcuts-77949.html
1) If for two numbers x+y = k (=constant), then their PRODUCT is MAXIMUM if x = y (=k/2). The maximum product is th
2) If for two numbers x*y = k (=constant), then their SUM is MINIMUM if x = y (=root(k)). The minimum sum is then 2*ro
7) If a+b+c+d=constant , then the product a^p * b^q * c^r * d^s will be maximum if a/p = b/q = c/r = d/s
8) x^n -a^n = (x-a)(x^(n-1) + x^(n-2) + .......+ a^(n-1) ) ......Very useful for finding multiples. eg: 17-14=3 will be a multiple
9) when a three digit number is reversed and the difference of these two numbers is taken, the middle number is alwa
11) knowing |x|-|y| and |x|+|y| is not enough to know |x-y| (man5-13)
12) Factorials and trailing zeros: count how many times 5 is a factor of the factorial
13) Number of powers of a prime number k in n!: shortcut: n/k+n/k^2+n/k^3 … until k^x>n (then stop). Eg: Power of 2 in 25
GEOMETRIC PROGRESSION ('A1' + 'A2 '+ 'A3' = 'A1'*(r^0) + 'A1'*(r^1) + 'A1'*(r^2)) = A + A*r + A*(r^2) --- Notice that 'A1' = A
1) 'An' = A * r^(n-m) = 'An-1' * r where r is the common ratio between elements in the sequence; if r=1 then all elements are
2) 'S(m,n)' = A * (r^(n+1) - r^m) / (r-1) -----> if m=0 => 'S(0,n)' = A * (r^(n+1) - 1) / (r-1) --- Note: sum goes from m=0 to n -> t
3) if number of elements infinite => 'Sn' = A * r^m / (1-r) -----> if m=0 => 'Sn' = A / (1-r)
4) Product of elements (for m=0): [sqrt( A * 'An+1')]^(n+1) (if A,r>0)
5) Average (for m=0): nroot(A * A*r * … * A*r^n)
maximum product is then (k 2)/4 .
e middle number is always 9 and the sum of the other two numbers is always 9 .
^2) --- Notice that 'A1' = A(0) --> use nomenclature A for the initial value (instead of 'A1' or 'Am')
r=1 then all elements are equal
m goes from m=0 to n -> there are n+1 elements ('An+1' is the last)
NP. Powers-Roots
POWER
Diff w/ prev for squares 1 2 3 4 10 Last digit cycle
1 1 1 1 idem 1
3 2 4 8 16 1024 cycle of 4 (2,4,8,6) 2
5 3 9 27 81 59049 cycle of 4 (3,9,7,1) 3
7 4 16 64 256 cycle of 2 (4,6) 4
9 5 25 125 625 idem 5
11 6 36 216 1296 idem 6
13 7 49 343 2401 cycle of 4 (7,9,3,1) 7
15 8 64 512 4096 cycle of 4 (8,4,2,6) 8
17 9 81 729 6561 cycle of 2 (9.1) 9
19 10 100 1000 10000 idem 10
21 11 121 1331 14641 11
23 12 144 1728 20736 12
25 13 169 2197 28561 13
27 14 196 2744 38416 14
29 15 225 3375 50625 15
31 16 256 4096 65536 16
33 17 289 4913 83521 17
35 18 324 5832 104976 18
37 19 361 6859 130321 19
39 20 400 8000 160000 20
41 21 441 9261 194481 21
43 22 484 10648 234256 22
45 23 529 12167 279841 23
47 24 576 13824 331776 24
49 25 625 15625 390625 25
51 26 676 17576 456976 26
53 27 729 19683 531441 27
55 28 784 21952 614656 28
57 29 841 24389 707281 29
59 30 900 27000 810000 30
61 31 961 29791 923521 31
63 32 1024 32768 1048576 32
65 33 1089 35937 1185921 33
67 34 1156 39304 1336336 34
69 35 1225 42875 1500625 35
71 36 1296 46656 1679616 36
73 37 1369 50653 1874161 37
75 38 1444 54872 2085136 38
77 39 1521 59319 2313441 39
79 40 1600 64000 2560000 40
81 41 1681 68921 2825761 41
83 42 1764 74088 3111696 42
85 43 1849 79507 3418801 43
87 44 1936 85184 3748096 44
89 45 2025 91125 4100625 45
91 46 2116 97336 4477456 46
93 47 2209 103823 4879681 47
95 48 2304 110592 5308416 48
97 49 2401 117649 5764801 49
99 50 2500 125000 6250000 50
OTHERS
1) 0^0 not defined
2) 2^33 < 10^10 < 2^34
3) Cycle for 7 = cycle for 3 inverted; cycle for 8 = cycle for 2 inverted
ROOT
2 3 Diff w/ prev for sqrt Diff w/ prev for cbrt
1 1
1.41 1.26
1.73 1.44 0.32 0.18
2 1.59 0.27 0.15
2.24 1.709976 0.24 0.12
2.45 1.817121 0.21 0.11
2.65 1.912931 0.20 0.10
2.83 2 0.18 0.09
3 2.080084 0.17 0.08
3.16 2.154435 0.16 0.07
3.316625 2.22398 0.15 0.07
3.464102 2.289428 0.15 0.07
3.605551 2.351335 0.14 0.06
3.741657 2.410142 0.14 0.06
3.872983 2.466212 0.13 0.06
4 2.519842 0.13 0.05
4.123106 2.571282 0.12 0.05
4.242641 2.620741 0.12 0.05
4.358899 2.668402 0.12 0.05
4.472136 2.714418 0.11 0.05
4.582576 2.758924
4.690416 2.802039
4.795832 2.843867
4.898979 2.884499
5 2.924018
5.09902 2.962496
5.196152 3
5.291503 3.036589
5.385165 3.072317
5.477226 3.107233
5.567764 3.141381
5.656854 3.174802
5.744563 3.207534
5.830952 3.239612
5.91608 3.271066
6 3.301927
6.082763 3.332222
6.164414 3.361975
6.244998 3.391211
6.324555 3.419952
6.403124 3.448217
6.480741 3.476027
6.557439 3.503398
6.63325 3.530348
6.708204 3.556893
6.78233 3.583048
6.855655 3.608826
6.928203 3.634241
7 3.659306
7.071068 3.684031
NP. Multiples
Cycle of 1: 1, #s ending in 0
Cycle of 2: #s ending in 5
Cycle of 5: even #s (except #s ending in 0)
Cycle of 10: 9, primes (except 2)
NP. DIVISIBILITY TESTS
http://en.wikipedia.org/wiki/Prime_number
PRIMES
1) all prime numbers except 2 and 5 end in 1, 3, 7 or 9
2 3) If p is prime and a is any integer, then a^p − a is divisible by p
3 5) An integer p > 1 is prime if and only if the factorial (p − 1)! + 1 is divisible by p
5 p=7 721 103
7 Conversely, an integer n > 4 is composite if and only if (n − 1)! is divisible by n
11 n=6 120 20
13 6) If n is a positive integer greater than 1 there is always a prime number p with n < p < 2n
17 7) In every arithmetic progression a, a + q, a + 2q, …
19 where the positive integers a and q are coprime, there are infinitely many primes
23
29
31
37
41
43
47
53 Primality Tests
59 Divide by all primes less than or equal to the square root of that number.
61 If any of the divisions come out as an integer, then the original number is not a prime.
67 all primes are of the form 6k ± 1, with the only exceptions of 2 and 3
71 So a more efficient method is to test if n is divisible by 2 or 3,
73 then to check through all the numbers of form 6k ± 1 <= n^(1/2)
79
83
89
97
…
199
…
293
…
397
…
499
…
599
…
691
…
797
…
887
…
997
etc
NP. RECURRING DECIMALS
http://en.wikipedia.org/wiki/Recurring_decimal
http://gmatclub.com/forum/counting-digits-m09q17-66823.html
http://gmatclub.com/forum/m01-70917.html
SUMMATORY
From To all even odd div3
1 10 55 30 25 18
1 20 210 110 100 63
1 30 465 240 225 165
1 40 820 420 400 273
1 50 1275 650 625 408
1 100 5050 2550 2500 1683
UMBERS
9*9*1=81
9*1*9=81
1*9*9=81
9*1*1=9
1*9*1=9
1*1*9=9
1*1*1=1
271
271
1000/10*1=100
1000/100*9=90
1000/1000*(100-19)=81
7*9*1=63
7*1*9=63
-
7*1*1=7
-
-
-
133
G. Pythagorean Triples
p odd>q q odd a=pq b = (1/2) (p2 - q2) c = (1/2) (p2 + q2) diff w nxt diff w nxt diff w nxt
7 3 21 20 29
11 3 33 56 65
13 3 39 80 89 6 24 24
15 3 45 108 117 6 28 28
7 5 35 12 37
9 5 45 28 53 10 16 16
11 5 55 48 73 10 20 20
13 5 65 72 97 10 24 24
9 7 63 16 65
11 7 77 36 85 14 20 20
13 7 91 60 109 14 24 24
15 7 105 88 137 14 28 28
http://www.mathwarehouse.com/geometry/circle/tangents-secants-arcs-angles.php
2) Apollonius circle
When AP / BP = AC / BC => PC is the bisector of interior angle APB, and PD bisects the corresponding exterior angle
inradius = r =
http://www.efunda.com/math/areas/CircleInscribeTriangleGen.cfm
circumradius = R = abc/4rk
http://mathworld.wolfram.com/Circumradius.html
If it is an equilateral triangle:
Per = 3sqrt(3)*R
A = [3sqrt(3)*R^2]/4
9) Equilateral triangle with side a -> if 3 circles be drawn inside this triangle touching each other then each's radius =
1) APPOLLONIUS THEOREM: In any triangle the angular bisector of an angle bisects the base in the ratio of the other
BD/DC = n/m
2) The coordinates of the centroid of a triangle with vertices (a,b) (c,d) (e,f) are: (a+c+e)/3 , (b+d+f)/3) .
4) Let W be any point inside a rectangle ABCD . Then WD^2 + WB^2 = WC^2 + WA^2
http://math.about.com/library/blmeasurement.htm
IRREGULAR SOLID
volume (area of base) * h
surface A 2*(area of base) + (per of base) * h
CUBE
volume a3
surface A 6a2
d sqrt(3)*a SPHERE
radius of circumscr. sphere sqrt(3)*a/2 volume (4/3) pi r 3
radius of inscribed sphere a/2 surface A 4 pi r 2
PYRAMID
volume (area of base) * h /3
surface A (area of base) + (area of all triangular faces)
CONE
volume (area of base) * h /3 = (pi r 2) * h /3
surface A (area of base) + Pi*r*d = (Pi*r^2) + Pi*r*d
d sqrt(r^2 + h^2)
G. Circles-Squares (Pi)
OTHER PROPERTIES
1) If an equation all co-efficients of any powers of x are positive, it has no positive roots then. (may have negative roots if c
If an equation all co-efficients of any powers of x are negative, it has no positive roots then. (may have negative roots if coe
2) If all the even powers of x have same sign coefficients and all the odd powers of x have the opposite sign coefficients, t
3) DESCARTES rules of signs: For f(x)=0, the maximum number of positive roots is the number of sign changes in f(x); a
FACTORING METHOD
Factor 2x^2 + x – 6
1)
then. (may have negative roots if coefficients of odd powers are big enough -> see graphs below)
en. (may have negative roots if coefficients of odd powers are small enough -> see graphs below)
ve the opposite sign coefficients, then the equation has no negative roots. Eg x^2-x+2=0
e number of sign changes in f(x); and the maximum number of negative roots is the number of sign changes in f(-x).
he equation in the same direction
imum will be the point where its derivative =0
maximum will be the point where its derivative =0
. If >0 then it’s a minimum, if <0 the it’s a maximum
roots. Eg x^2-x+2=0
COMBINATORICS
nCr = n! / r! (n-r)!
nPr = n! / (n-r)! = nCr * r!
CONDITIONAL PROBABILITY
P of A given B = P(A|B) = P(A intersection B) / P(B)
CIRCULAR PERMUTATIONS
The number of ways to arrange n distinct objects along a circle is (n-1)!
Distributing n identical things amongst r people such that any person might get any number of things ( including 0) is
PROBABILITY - DICE
The 216 possible outcomes of rolling 3 dice simultaneously can be summarised as follows:
sum ways diff w. prev prob
3 1 0.5%
4 3 2 1%
5 6 3 3%
6 10 4 5%
7 15 5 7%
8 21 6 10%
9 25 4 12%
10 27 2 13%
11 27 0 13%
12 25 -2 12%
13 21 -4 10%
14 15 -6 7%
15 10 -5 5%
16 6 -4 3%
17 3 -3 1%
18 1 -2 0.5%
216 100.0%
6^3
http://homepage.smc.edu/mcgraw_colleen/math_52/dice%20roulette.pdf
PROBABILITY - COINS
The counting method works, and is very good for getting the right answer with a small number of coins. However, for larger nu
the denominator is 2^n for n coins. Numerator: use Pascal's Triangle
start 1
1st toss 1
2nd toss 1 2
3rd toss 1 3
4th toss 1 4 6
5th toss 1 5 10
6th toss 1 6 15 20
Every line is made by adding the two numbers in the line above. You assume that there are zeros at the start and end of each
Take the nth row of Pascal's triangle, and the mth number in it, and you have the numerator (top bit) of the probability
eg: on 5 tosses the probability of finding 2 heads is 10 / 2^5 = 0.3125
http://gwydir.demon.co.uk/jo/probability/info.htm
http://gmatclub.com/forum/permutation-combination-and-probabilities-14706.html
number of things ( including 0) is (n+r-1)C(r-1)
The 36 cases:
11 12 13 14 15 16
21 22 23 24 25 26
31 32 33 34 35 36
41 42 43 44 45 46
51 52 53 54 55 56
61 62 63 64 65 66
http://gwydir.demon.co.uk/jo/probability/calcdice.htm
ber of coins. However, for larger numbers, we need a more mathematical approach. We know that
1
1
3 1
4 1
10 5 1
15 6 1
e zeros at the start and end of each line, and you start with a one in the top row.
merator (top bit) of the probability of finding m heads when tossing n coins.
2) Range = | largest number - smallest number| -> 0 is neither +ve nor -ve => range of eg (7,0) = 7 - 1 = 6
3) The median of the combined set (A) must be any value at or between the medians of the two smaller sets (B and C)
4) The sum of the deviations of the elements from the mean must be 0
7) If you multiply all terms by x then SD =x times old SD and the mean = x times old mean
8) SD does not change when the same constant is added/subtracted to all the members of the set
10) For data with approximately the same mean, the greater the range, the greater the SD
12) Only need to know the difference between values and total number of values to compute SD.
13) SD is not dependent on the average, but on the deviation from the average => just by knowing that two sets have
14) For comparing the SD of two sets any information about mean/median/mode/range is insufficient unless you can
wing that two sets have different averages doesn't say anything about SD
fficient unless you can determine the individual terms from the given data.
FDP
PERCENTS
0.8*1.25 = 1
0.66*1.5 = 1
OTHERS
1) If "a" is small, x/(y+a) is close to (x/y-a). Eg: 4/(2+0.001) is close to (2-0.001)=1.999
2) 1/60+1/40=1/24
3) if xy>(x+y)*2 => x,y>1 if xy>x+y => x,y>2
INTEREST
. compund interest: X2 = X0 * (1+r/c)^(t*c) where r=annual rate, c=number of times compounded annually, and t=number of
Eg: invest 100 at 10% per annum compounded quarterly for half a year, and the principal will grow to -> 100 * (1 +
. Simple interest = X0 * r * t
0.833
0.857
0.875
1) Backsolving: when answer choices have variables in them, start from the LAST
2) Guessing PS: go with D or E (especially with problems that force you to use or plug in answer choices)
Same applies to fully underlined SC
3) Guessing DS
Half the time A and B are both insufficient -> 50% chances for C or E
Don't choose E if you have to guess -> based on the above, on a wild guess, C would be the best choice
If you can eliminate B/D -> pick A or C
Historically A is slightly more common as the right answer (yes, it does contradict the above)