Quant 1

GMAT Quantitative - 1
GMAT – Zero To Hero

Introduction to GMAT Quantitative Section
Problem Solving Data Sufficiency
• Number of Questions: ~16/37

• Number of Questions: ~21/37
• Logic Problems
• Calculation Problems
• Purpose: Verify possibility of
• Purpose: Find the answer
getting answer
Problem Solving Example
12!
𝑛 is the product of the first 5 prime numbers. If is divisible by 2𝑘 , what is the
𝑛
greatest value of a positive integer 𝑘?
(A) 6
(B) 7
(C) 8
(D) 9
(E) 10
Data Sufficiency Example
Is integer 𝑘 a prime number?

(1) 𝑘 = 10! + 𝑚, where 1 < 𝑚 < 8
(2) 𝑘 is a multiple of 7
(A) Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
(B) Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
(C) BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
(D) EACH statement ALONE is sufficient.
(E) Statements (1) and (2) TOGETHER are NOT sufficient.
Data Sufficiency Explain
How old is Isaac?

1) Isaac’s younger brother Paul is 18.
2) Isaac’s younger brother Paul is exactly 10 years younger than Isaac.
The two statements:
• They’re there to help – You can never solve the problem without them.
• They don’t lie – Information given always correct.
• They don’t contradict each other – If you find the two statements give contradict
answers, you get it wrong.
• Are the same across all questions  Remember them
Data Sufficiency – Decision Tree
DS – Common Mistake Type 1
No is also an answer (sufficient)
Is 𝑥 > 0 ?
1. 𝑥 = −1
2. 2𝑥 2 + 1 > 0
DS – Common Mistake Type 2
The number of answer must be one (UNIQUE)
Is 𝑟 = ?
1. 𝑟 3 − 𝑟 2 − 6𝑟 = 0
2. 𝑟 = −2𝑟
DS – Rephrasing Question
If 𝑗 is a positive integer, is 𝑗 3 − 27 2
𝑗3 + 1 3
odd?
Is 𝑗 even?
DS – Rephrasing Question
What number is 15% of 𝑥 ?

1. 18 is 6% of 𝑥
2. 2/3 of 𝑥 is 200
Question: What is 𝑥 ?
1. We know the value of 𝑥
2. We know the value of 𝑥
 We know for sure that we can solve the problem using either statement (1) or (2)
DS – Let’s play the game
Determine which of the statements, ALONE, would be sufficient to answer the

question.
Is 𝑥 > 0 ?
(A) 3𝑥 is an integer
(B) 𝑥 2 < 𝑥
(C) 𝑥 2 – 3𝑥 + 2 = 0
(D) 𝑥 is a prime number
(E) 𝑥 2 – 3𝑥 – 4 = 0
DS – Let’s play the game
Determine which of the statements, ALONE, would be sufficient to answer the

question.
In isosceles triangle 𝐴𝐵𝐶, what is the measure of angle 𝐴?

(A) Angle 𝐵 = 30 degrees
(B) Angle 𝐶 = 120 degrees
(C) Angle 𝐴 is one-fourth the measure of angle 𝐶
(D) Angles 𝐴 and 𝐵 add to half the measure of angle 𝐶
(E) The length of side 𝐵𝐶 = 2 2
Number Properties
Theory review
Number Theory
Number Theory is concerned with the properties of numbers in general, and in particular
integers.
GMAT is dealing only with Real Numbers: Integers, Fractions and Irrational Numbers.
› Integer: whole number {… − 3, −2, −1, 0, 1, 2, 3 … }

› Fraction: (also known as rational numbers) can be written as terminating (ending) or
repeating decimals (such as 0.5, 0.76, or 0.333333....)
› Irrational Number: all those numbers that can be written as non-terminating, nonrepeating
decimals are non-rational
• Negative Numbers: All numbers that are less than 0

• Positive Numbers: All numbers that are greater than 0
• By this definition: 0 is neither positive nor negative
Odd & Even
Even integer: any integer that is divisible by 2; {…-6, -4, -2, 0, 2, 4, 6…}
Odd Integer: any integer that is divisible by 2; {…-5, -3, -1, 1, 3, 5…}
+/- Even Odd Multiplication Even Odd
Even Even Odd Even Even Even
Odd Odd Even Odd Even Odd

Odd - Even Example
If 𝑚 and 𝑛 are integers, is 𝑚 odd?
1. 𝑛 + 𝑚 is odd
2. 𝑛 + 𝑚 = 𝑛2 + 5
Odd - Even Example
Is the product 𝑠𝑡 negative?
1. 𝑠 2 − 𝑠 < 0
𝑠−4
2. 𝑡−3
=1
Prime Numbers
A prime is a number has no factors other than 1 & itself.
› Number 1 is not considered prime, as it has only one factor (itself).

› Thus, the first prime number is 2, which is also the only even prime.
› The first ten prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23, and 29.
› When solving prime question, always check for number 2
› Prime factorization: break a number down into its

prime factors.
› 72 = 6 ∗ 12 = 23 32
Prime Factorization
If 𝑎, 𝑏, 𝑐 are three different integers & 1,485 = 𝑎 𝑥 𝑏 𝑦 𝑐 𝑧 , then 𝑎𝑏𝑐 = ?
1. 1,485 = 𝑎3 𝑏𝑐
2. 𝑐 = 11
How to verify if a number is a prime
Verify is the number has any factor other than 1 & its self
› Dividing 𝑛 by all integers from 1 to 𝑛?

𝑛
› Dividing 𝑛 by all integers from 1 to ?
2
› Dividing 𝑛 by all integers from 1 to 𝑛
› Is 161 a prime number?

– 161 < 13 so we will try dividing 161 by all integer from 2 to 12
– 161 is divisible by 7  161 is not a prime number
GCD & LCM
The greatest common divisor (GCD) is the largest positive integer that divides the numbers
without a remainder.
The lowest common multiple (LCM) is the smallest positive integer that is divisible by each of
the numbers.
› What are GCD & LCM of 30 & 24?

2 2
› 30 = 2.3.5 & 24 = 23 . 3 30 5 24
3 2
3
› 𝐺𝐶𝐷 = 2.3 & 𝐿𝐶𝑀 = 2 . 3.5 = 120
Divisibility Rules
› 2: if it is EVEN
› 3: if the sum of integer’s digits is divisible by 3
› 4: if the integer is div. by 2 twice or if THE LAST TWO DIGITS are divisible by 4
› 5: If the integer ends in 5 or 0
› 6: if the integer is divisible BOTH by 2 and 3
› 8: if the integer is divisible by 2 three times or IF THE LAST 3 DIGITS are divisible by 8
› 9: if the sum of the integer digits is divisible by 9
› 10: if the integer ends in 0
› 11: sum of digits in odd places – sum of digits in even places either = 0 or divisible by 11.
› 12 - If the number is divisible by both 3 and 4, it is also divisible by 12.
› 25 - Numbers ending with 00, 25, 50, or 75 represent numbers divisible by 25.
Remainder
A remainder is defined as the integer portion of the dividend (or numerator) that is not evenly divisible
by the divisor (or denominator).
𝑦 = 𝑥𝑞 + 𝑟 with 0 ≤ 𝑟 < 𝑥 : 𝑞 is quotient and 𝑟 is remainder
› You can add and subtract remainders directly, as long as you correct excess or negative remainders.
102 + 110 2+3
– 102 = 25*4 + 2; 111 = 27*4 + 3  remainder of = remainder of =1
4 4
› You can multiply remainders, as long as you correct excess remainders at the end.
102 ∗ 110 2∗3
– 102 = 25*4 + 2; 111 = 27*4 + 3  remainder of = remainder of =2
4 4
› If 𝑦 = 𝑥𝑞 + 𝑟 and 𝑥 = 𝑎. 𝑏 then the remainder of 𝑦 when divided by 𝑎 = the remainder of 𝑟 when

divided by 𝑎.
106 2
– 106 = 26*4 + 2; 26 = 13*2  remainder of = remainder of =2
13 13
Cycle of powers
This is used to find the remainder of 𝑛 𝑥 , when divided by 10, as it helps us in figuring out the last digit
of 𝑛 𝑥 .
What is the remainder of 1381 when divided by 10?
› 2: 2, 4, 8, 6 → all 2𝑘+4𝑛 will have the same last digit.

› 4: 4, 6 → all 4𝑘+2𝑛 will have the same last digit.
› 5: 5 → all 5𝑛 will have the same last digit.
› 6: 6 → all 6𝑛 will have the same last digit.
› 7: 7, 9, 3, 1 → all 7𝑘+4𝑥 will have the same last digit.
› 9: 9, 1 → all 9𝑘+2𝑛 will have the same last digit.
Divisibility Example
Is integer 𝑥 2 𝑦 4 divisible by 9?
1. 𝑥 is an integer divisible by 3
2. 𝑥𝑦 is an integer divisible by 9
Remainder Example
Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 3
after division by 5. If n is greater than 30, what is the remainder that n leaves after
division by 30?
(A) 3
(B) 12
(C) 18
(D) 22
(E) 28
Remainder Example
When positive integer A is divided by positive integer B, the result is 4.35. Which
of the following could be the remainder when A is divided by B?
(A) 13
(B) 14
(C) 15
(D) 16
(E) 17
Remainder Example
10𝑚 +𝑛
If 𝑚 and 𝑛 are positive integers, is the remainder of larger than the remainder of
3
10𝑛 +𝑚
?
3
1. 𝑚 > 𝑛
𝑛
2. The remainder of 3 is 2
Factor
A divisor of an integer 𝑛, also called a factor of 𝑛, is an integer which evenly divides 𝑛
without leaving a remainder. In general, it is said 𝑚 is a factor of 𝑛, for non-zero integers
𝑚 and 𝑛 , if there exists an integer 𝑘 such that 𝑛 = 𝑘𝑚.
› Factor foundation rules:

– 1 (and -1) are divisors of every integer.
– Every integer is a divisor of 0, except, by convention, 0 itself.
– If 𝑎 is a factor of 𝑏 and 𝑏 is a factor of 𝑐 then 𝑎 is a factor of 𝑐
– If 𝑎 is a factor of 𝑏 and a is a factor of 𝑐 then 𝑎 is a factor of (𝑚𝑏 + 𝑛𝑐) for all integer
𝑚&𝑛
– If 𝑝 is a prime number and is a factor of 𝑎𝑏 then 𝑝 is a factor of 𝑎 or 𝑝 is a factor of 𝑏
How many factors does a number have?
› Method 1: building table with factor pairs: Small Large
– Example: How many factors does 72 have? 1 72
– We can see that 72 has 12 factors 2 36
– Any integer has a limited number of factors but infinite number 3 24
of multiples. 4 18
– Only perfect squares have odd number of factors, all other 6 12
numbers have even number of factors 8 9
› Method 2 (Recommended): If 𝑛 = 𝑎 𝑥 𝑏 𝑦 𝑐 𝑧 , where a, b and c are

primes, then 𝑛 has (𝑥 + 1)(𝑦 + 1)(𝑧 + 1) total factors.
– Example: How many total factors does the number 2,000 have?
– With prime factorization we find that 2,000 = 24 . 5³. So, 2,000
has 5.4 = 20 total factors
Factorial
Factorial of a positive integer 𝑛, denoted by 𝑛!, is the product of all positive integers less than
or equal to 𝑛. For instance 5! = 1.2.3.4.5 = 120.
• Note: 0!=1.
• Note: factorial of negative numbers is undefined
› Trailing zeros: The number of consecutive zeros at the end of a number.

› E.g. 250000 has 4 trailing zeros.
› The number of trailing zeros of a number can be calculated by:
𝑛 𝑛 𝑛 𝑛
+ + +⋯+ with 5𝑘 < 𝑛
5 52 53 5𝑘
› How many trailing zeros that 32! Has?

32 32
+ 2 =6+1=7
5 5
Consecutive Integers
Consecutive integers are integers that follow one another, without skipping any integers. E.g.
7, 8, 9, and -2, -1, 0, 1, are consecutive integers.
› The number of elements = Last element – First Element +1

– E.g. How many number from 15 to 44? 44 – 15 +1 = 30 numbers
𝑛 𝑛+1
› Sum of 𝑛 first consecutive integers: S𝑢𝑚 = 2
100 101
– E.g. Sum of integers from 1..100? 𝑆𝑢𝑚 = = 5050
2
𝐹𝑖𝑟𝑠𝑡+𝐿𝑎𝑠𝑡
› Find the average: 𝐴𝑣𝑒𝑟𝑎𝑔𝑒 = 2
› If 𝑛 odd, sum of 𝑛 consecutive integers ALWAYS divisible by 𝑛.

– E.g. Sum {9, 10, 11} = 30 divisible by 3
› If 𝑛 even, sum of 𝑛 consecutive integers NEVER divisible by 𝑛.
– E.g. Sum {2, 3, 4, 5} = 14 is not divisible by 4
Evenly Spaced Set
Evenly spaced set or an arithmetic progression is a sequence of numbers such that the
difference of any two successive members of the sequence is a constant. {3, 6, 9, 12}
› Formula: 𝑎𝑛 = 𝑎1 + 𝑑(𝑛 − 1)
𝑎1 +𝑎𝑛
› 𝑀𝑒𝑎𝑛 = 𝑀𝑒𝑑𝑖𝑎𝑛 = 2
𝑎𝑛 −𝑎1
› 𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 = +1
𝑑
𝑎1 +𝑎𝑛 2𝑎1 +𝑑 𝑛−1
› 𝑆𝑢𝑚 = ∗𝑛= ∗𝑛
2 2
› Special cases:
– Sum of 𝑛 first odd numbers: 1 + 3 + … + 𝑎𝑛 = 𝑛2 with 𝑎𝑛 = 2𝑛 − 1
› E.g. 1 + 3 + 5 + 7 + 9 = 52 = 25
– Sum of n first even numbers: 2 + 4 + 6 + … + 𝑎𝑛 = 𝑛 𝑛 + 1 with 𝑎𝑛 = 2𝑛
› E.g. 2 + 4 + 6 + 8 = 4 4 + 1 = 20
Consecutive Integers
In how many ways can 105 be expressed as a product of consecutive odd integers?
(A) 1
(B) 2
(C) 3
(D) 4
(E) 5
Consecutive Integers Example
Is k² odd?
(1) k-1 is divisible by 2
(2) The sum of k consecutive integers is divisible by k
Hidden Integers
The numbers of animals, people, fruits, cars, … and so on can only be integers. This is an
important hidden clue.
What is the total number of golf clubs that John and Tom have?
1. The number of golf clubs that John has is 80 percent more than that of Tom’s.
2. The number of golf clubs that Tom has is between 11 and 16.
Hidden Integers
There are 5 locks and 5 keys such that each of the 5 keys matches up with each of
the 5 locks. What is the minimum number of trials and the maximum number of
trials to ensure we correctly match the 5 keys to their corresponding 5 locks?
(A) 5, 15
(B) 4, 15
(C) 5, 10
(D) 4, 10
(E) 5, 20
Hidden Integers
There are 5 locks and 5 keys such that each of the 5 keys matches up with each of
the 5 locks. What is the minimum number of trials and the maximum number of
trials to ensure we correctly match the 5 keys to their corresponding 5 locks?
L1 L2 L3 L4 L5 Min = 4
K1 K2 K3 K4 K5 Max = 4 + 3 + 2 +1 = 10

Quant 1

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Quant 1

Uploaded by

Copyright:

Available Formats

GMAT Quantitative - 1

GMAT – Zero To Hero

Problem Solving Data Sufficiency

• Number of Questions: ~16/37

Is integer 𝑘 a prime number?

How old is Isaac?

The two statements:

No is also an answer (sufficient)

The number of answer must be one (UNIQUE)

What number is 15% of 𝑥 ?

Determine which of the statements, ALONE, would be sufficient to answer the

Determine which of the statements, ALONE, would be sufficient to answer the

In isosceles triangle 𝐴𝐵𝐶, what is the measure of angle 𝐴?

› Integer: whole number {… − 3, −2, −1, 0, 1, 2, 3 … }

• Negative Numbers: All numbers that are less than 0

+/- Even Odd Multiplication Even Odd

Even Even Odd Even Even Even

Odd Odd Even Odd Even Odd

› Number 1 is not considered prime, as it has only one factor (itself).

› Prime factorization: break a number down into its

› Dividing 𝑛 by all integers from 1 to 𝑛?

› Dividing 𝑛 by all integers from 1 to 𝑛

› Is 161 a prime number?

› What are GCD & LCM of 30 & 24?

𝑦 = 𝑥𝑞 + 𝑟 with 0 ≤ 𝑟 < 𝑥 : 𝑞 is quotient and 𝑟 is remainder

› If 𝑦 = 𝑥𝑞 + 𝑟 and 𝑥 = 𝑎. 𝑏 then the remainder of 𝑦 when divided by 𝑎 = the remainder of 𝑟 when

What is the remainder of 1381 when divided by 10?

› 2: 2, 4, 8, 6 → all 2𝑘+4𝑛 will have the same last digit.

› Factor foundation rules:

› Method 2 (Recommended): If 𝑛 = 𝑎 𝑥 𝑏 𝑦 𝑐 𝑧 , where a, b and c are

› Trailing zeros: The number of consecutive zeros at the end of a number.

› How many trailing zeros that 32! Has?

› The number of elements = Last element – First Element +1

› If 𝑛 odd, sum of 𝑛 consecutive integers ALWAYS divisible by 𝑛.

You might also like