Scribd
Upload
175 views1 page

GMAT Number Properties Summary

The document discusses several topics related to number theory including: 1) Divisibility rules for determining if an integer is divisible by 3, 4, 6, 8, or 9 based on the sum or last digits. 2) Properties of multiples, odds, and evens when adding, subtracting, or multiplying integers. 3) Concepts involving prime numbers like all primes after 2 being odd and factorization. 4) Methods for finding greatest common factors and least common multiples using prime factorizations. 5) Characteristics of perfect squares and their number of factors.

Uploaded by

Sumit Gupta
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
175 views1 page

GMAT Number Properties Summary

The document discusses several topics related to number theory including: 1) Divisibility rules for determining if an integer is divisible by 3, 4, 6, 8, or 9 based on the sum or last digits. 2) Properties of multiples, odds, and evens when adding, subtracting, or multiplying integers. 3) Concepts involving prime numbers like all primes after 2 being odd and factorization. 4) Methods for finding greatest common factors and least common multiples using prime factorizations. 5) Characteristics of perfect squares and their number of factors.

Uploaded by

Sumit Gupta
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Divisibility Rules 3: Sum of digits divisible by 3 4: Integer is divisible by 2 twice Last two digits divisible by 4 6: Integer is divisible by both

2 and 3 8: Integer is divisible by 2 three times Last three digits divisible by 8 9: Sum of digits divisible by 9

Multiples and Odd/Evens Adding or subtracting multiples of N results in another multiple of N Multiple of N Non-Multiple of N = Non-Multiple of N Non-Multiple of N Non-Multiple of N = EITHER (unless N=2, then Multiple) Odd 2N 1 Even 2N Odd Odd = Even Even Even = Even Odd Even = Odd

Prime numbers and factorization 168 First 10 primes: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 All prime numbers, except for 2, are ODD 7, 2, 2, 2, 3 If a is a factor of b, and b is a factor of c, then a is a factor of c Prime Factor Box: Any number built out of prime factors of N is also a factor of N

= +

Even Anything = Even Odd Odd = Odd

Basis for Division

60 is a factor of j 2, 2, 3, 5, ?

All perfect squares have an odd number of total factors; all other numbers have an even number Prime factorization of perfect squares contain only even powers of primes (36 -> 22 32) Similar for other perfect powers, e.g., perfect cubes contain powers that are multiples of 3 Total # of factors: Prime factorize; (exp1 +1) (exp2 +1) [e.g., 2000 -> 24 53 -> (4+1) (3+1) -> 20 total factors] GCF / LCM GCF x,y (product of shared prime factors) LCM x,y (product of all prime factors minus overlap) (GCF of x,y) (LCM of x,y) = x y GCF of x,y cannot be larger than x-y [else x,y not multiples of GCF] Consecutive multiples of x have a GCF of x Prime column method for calculating GCF and LCM Prime Factors # 2 5 7 2 2 100 2 5 140 22 51 71 250 21 53 1 1 GCF 2 5 70 = 10 2 3 LCM 2 5 71 = 3500 GCF is the product of the lowest powers in each column LCM is the product of the highest powers in each column
Evaluate Statement 1
Sufficient Not Sufficient St. 2 Sufficient

Combinatorial and Probability OR Addition AND Multiplication Unique Arrangements = n! If x members repeat, divide by x! e.g., # of arrangements of EEL = e.g., 8 mbr group sends 3 reps = If 2+ groups, combine them e.g., send 3b 2g out of 5b 6g:
i.e., x choose y !! ( )!
3! 2!
8! 3!()5!()

Break down complex probability problems into a series of AND and OR events
P(A) = 1 P(not A) Use choose to get number of possibilities

5! 3!2!

6! 2!4!

AD BCE

Is Q asking for: Value? Yes/No? (either suff.)


Evaluate Statements Together
Sufficient

Qs asking how many are usually combinatoric Grid Qs: count the number of decisions 6 steps: 3 south, 3 east 6! = 20 paths total
3!3!

AD BCE

AD BCE

St. 2 Not Suff.

Where objects need (not) be next to each other, count as single object and double value ABCDE and ABDCE 4! 2 For problems with multiple equivalent cases, multiply prob of one case by number of cases Machine has 5g 4r 3b balls. If machine gives 3 balls, prob of getting one of each color? 5 4 3 3 12 11 10 3! (# of cases) = 11

AD BCE

St. 2 Sufficient

St. 2 Not Suff.

AD BCE

AD BCE

Not Sufficient

AD BCE

AD BCE

You might also like