Arithmetic and Number Properties Advanced PDF
Arithmetic and Number Properties Advanced PDF
Number
! Properties!
Learning Objectives!
Best viewed after you have covered Arithmetic and Number Properties in your Core sessions.!
The GMAT can make exponent and radical questions more difficult by!
The GMAT can make exponent and radical questions more difficult by!
(A) 2 3
3
(B) 2 3
(C) 6 3
(D) 18
(E) 18 3
(1) y = 4r
(2) r = 2
(A) x > -4
(B) x < -1
(C) x > 3
(D) |x| > 1
(E) |x| < 1
(A) x > 1
(B) x < -1
(C) x > -1
(D) |x| > 1
(E) |x| < 1
When the GMAT presents an unreasonably large number and asks about its factors, consider
using prime factorization to make the number more manageable.!
1512 =
(1) n = 60
(2) a, b, and c are prime
(A) 5
(B) 20
(C) 34
(D) 53
(E) 61
(1) x4 = 9
(2) The average (arithmetic mean) of x2, 6x, and 3 is -2
(A) 4
(B) 6
(C) 9
(D) 12
(E) 27
(A) 5
(B) 9
(C) 10
(D) 18
(E) 25
(1) (n – 6)(n – 7) = 0
(2) -14 > 1 – 3n
(A) II only
(B) III only
(C) I and II only
(D) II and III only
(E) I, II, and III
(A) 5,372
(B) 5,530
(C) 6,800
(D) 7,200
(E) 27,000
(A) 8
(B) 28
(C) 64
(D) 81
(E) 144
(A) 1
1
(B)
32
1
(C)
64
1
(D)
81
1
(E)
729
(2) y is an integer
(B) Statement (2) BY ITSELF is sufficient to answer the question, but statement (1) by itself is not.
(C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, even though
NEITHER statement BY ITSELF is sufficient.
(D) EITHER statement BY ITSELF is sufficient to answer the question.
(E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question, requiring more
data pertaining to the problem.
Correct Answer: C
Step 1: This is a value question. There are many variables in the stem but not much to do in terms of
simplification.
Step 2:
Statement 1: I. Confirm that there are multiple ways to break 603 into a product of three different
numbers by prime factorization: 603 = (22 · 3 · 5)3 = 26 · 33 · 53. So one value of x + y + z is 6 + 3 + 3 = 12,
but 26 can also be written as 43, so another value of x + y + z is 3 + 3 + 3 = 9.
Statement 2: I. This statement tells us nothing about n, and so cannot be sufficient to answer the
question.
Both statements together: S. The fundamental theorem of arithmetic states that there is only one way
to write every positive integer greater than 1 as a product of primes. Since statement 1 provides the
number, and statement 2 states that it is a product of prime factors, x, y, and z must be unique.
Question 6
6. If a is the smallest prime factor of the expression 2724 + 4(935) + 368, and b is the greatest prime factor
of the expression 2724 + 4(935) + 368, then what is the value of a + b?
(A) 5
(B) 20
(C) 34
(D) 53
(E) 61
Correct answer: E
Step 1: The question defines a and b as the smallest and greatest prime factors, respectively, of a
complicated exponential expression.
Step 2: The task here is to find the sum of a and b, which requires finding values for a and b.
Step 3: Since the problem gives a complicated expression involving unreasonably large numbers, it
cannot be expected to be possible to simply calculate the value of the expression. Instead, when faced
with such an expression, write its prime factorization. It contains the bases 3, 9, and 27
9 = = 32
27 = 33
Substituting these values into the expression gives (33)24 + 4[(32)35] + 368. Since (ab)c = abc, the expression
can be rewritten 372 + 4(370) + 368. It is now possible to factor 368 out of the expression using the identity
!!
= ! !!! and dividing each term by 368
!!
368[34 + 4(32) + 1]
368(81 + 36 + 1)
368(118)
118 can be factored into 2 · 59, so the full prime factorization of the original expression 368(118) is 368 · 2
· 59. Therefore, a = 2, b = 59, and a + b = 61.
Step 4: Confirm your reasoning and prime factorization.
Question 7
7. What is the value of x?
(1) ! ! = 9
(2) The average (arithmetic mean) of x2, 6x, and 3 is 2.
(A) Statement (1) BY ITSELF is sufficient to answer the question, but statement (2) by itself is not.
(B) Statement (2) BY ITSELF is sufficient to answer the question, but statement (1) by itself is not.
(C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, even though
NEITHER statement BY ITSELF is sufficient.
(D) EITHER statement BY ITSELF is sufficient to answer the question.
(E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question, requiring more
data pertaining to the problem.
Correct Answer: B
Step 1: Since no information about x is given in the question stem, go right to the statements.
Step 2:
Statement 1: I. This states that ! ! = 9, which means that x2 = 9, so x = 3 or -3 (an all-time favorite
GMAT trap).
Statement 2: S This says the average of x2, 6x, and 3 is -2, which, according to the average formula,
! ! !!!!!
means that = −2, so x2 + 6x + 3 = -6. Thus, x2 + 6x + 9 =0, so (x + 3)(x + 3) = 0, and x = -3.
!
Question 8
8. When positive integer m is divided by 5, the remainder is 3. What is the units digit of m?
(1) When m is divided by 3, the remainder is 1.
(2) m is prime.
(A) Statement (1) BY ITSELF is sufficient to answer the question, but statement (2) by itself is not.
(B) Statement (2) BY ITSELF is sufficient to answer the question, but statement (1) by itself is not.
(C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, even though
NEITHER statement BY ITSELF is sufficient.
(D) EITHER statement BY ITSELF is sufficient to answer the question.
(E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question, requiring more
data pertaining to the problem.
Correct Answer: B
Step 1: This is a value question. The information about m can be reworded to say that m is 3 more than
a multiple of 5. List off qualifying numbers to spot the pattern: m could be 3, 8, 13, 8, 23, 28, etc. So the
units digit of m is either 3 or 8.
Step 2:
Statement 1: I. This statement tells us that m is one more than a multiple of 3, but several numbers that
fit the pattern from the question stem also satisfy this statement: 13 = 12 +1; 28 = 27+1. Since the units
digit of m could still be 3 or 8, this statement is insufficient.
Statement 2: S. If m is prime, and the smallest possible value for m is 3, then m must also be odd. This
eliminates any values of m that end in an 8, leaving only those that end in 3.
Question 9
9. In a certain sequence, every term after the first is determined by multiplying the previous term by
some integer constant greater than 1. If a3 = 324, which of the following is a possible value of a0?
(A) 4
(B) 6
(C) 9
(D) 12
(E) 27
Correct Answer: D
Step 1: This question defines a geometric sequence and gives the third number in the sequence.
Step 2: The question asks for the starting number of the sequence.
Step 3: Let the constant of multiplication be called k. Given a0, a1 can be calculated by multiplying by k:
a1 = a0k. To get a2, multiply by k again: a2 = a1k = (a0k)k = a0k2; therefore an = a0kn.
Thus, a3 must be able to be written as a0k3, so to get 324, a0 must be multiplied by a perfect cube.
Prime factorization can be used to determine what that number might be.
324 = 2 · 2 · 3 · 3 · 3 · 3
The only way to get a perfect cube as a factor is to regroup as 2 · 2 · 3 · 33, or 12 · 33. Thus, a0 = 12, and k
= 3.
Step 4: Confirm by starting with a0 = 12 and multiplying by 3 each time to obtain the next number in the
sequence: a0 = 12, a1 = 36, a2 = 108, a3 = 324.
Question 10
10. 45! contains how many trailing zeroes?
(A) 5
(B) 9
(C) 10
(D) 18
(E) 25
Correct Answer: C
Step 1: This is a question about the divisibility of a factorial number. Not much is given.
Step 2: The question asks how many zeroes should be expected at the end of 45! once it is evaluated.
Step 3: Since it would be unreasonable to calculate 45! directly, it is necessary to find another way to
deduce the number of trailing zeroes. It is a property of divisibility that the number of zeroes at the end
of a number is equal to the number of times it can be divided by 10. For example, 300 has two trailing
zeroes, and is equal to 3 x 10 x 10.
A factorial is made up of all of the products of the numbers up to and including that number, so 45! = 45
x 44 x 43 x 42 x … x 2 x 1. To figure out how many times 45! can be divided by 10, consider that 10 = 2 x
5, so it is necessary to know how many pairs of 2 and 5 can be made out of all of the numbers less than
or equal to 45. Multiplying these numbers requires multiplying many more 2s than 5s, since every other
number is even, so the limiting factor is the number of times it is required to multiply by 5. There are
nine such numbers that are divisible by 5 that are factors of 45!: 5, 10, 15, 20, 25, 30, 35, 40, and 45, but
remember that 25 = 52, for a total of ten 5s. Each of these 5s can be paired with an even number to
make a factor of 10, so there are ten trailing zeroes in 45!.
Step 4: This is a pure reasoning question, and so checking by actually calculating 45! would be
unreasonable.
Question 11
11. If n is an integer such that !!!!!!
!
!!!, what is the value of n?
(1) (n – 6)(n – 7) = 0
(2) -14 > 1 – 3n
(A) Statement (1) BY ITSELF is sufficient to answer the question, but statement (2) by itself is not.
(B) Statement (2) BY ITSELF is sufficient to answer the question, but statement (1) by itself is not.
(C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, even though
NEITHER statement BY ITSELF is sufficient.
(D) EITHER statement BY ITSELF is sufficient to answer the question.
(E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question, requiring more
data pertaining to the problem.
Correct Answer: D
! !
Step 1: The expression given in this value question can be simplified; the only fractions between and
! !
! !
with integer denominators are and . So n – 1 must be 4 or 5. That is, n must be 5 or 6, but we need an
! !
exact value.
Step 2:
Statement 1: S. For (n – 6)(n – 7) to equal 0, then either n - 6 = 0 or n – 7 = 0. So n = 6 or 7. But the only
possible values for n in the question stem were 5 and 6, so n must equal 6.
Statement 2: S. Solve the inequality by doing the same thing to both sides:
-14 > 1 – 3n
-15 > -3n
5 < n (Note that since both sides are divided by a negative number the direction of the inequality
changes.)
Since the stem gives only 5 and 6 as possible values for n, but n > 5 according to statement 2, n must
equal 6.
Question 12
12. If |x| - |y| = |x+y|, and xy ≠ 0, which of the following could be false?
A. II only
B. III only
C. I and II only
D. II and III only
E. I, II, and III
Correct Answer: B
Step 1: The question stem gives an equation with two variables and absolute values, and states that
neither x nor y are 0.
Step 2: The task is to find the potentially false statements among the roman numerals; the wrong
answers will contain statements that must be true.
Step 3: A quick evaluation of the right side of the equation shows that it must be positive, so |x| - |y|
must also be positive, which means that |x| > |y|. Additionally, x and y cannot both be positive; if they
were, |x| - |y| = |x + y| would become x – y = x + y, which is only possible when y = 0, which is not
allowed. Similarly, x and y cannot both be negative, since |-x| - |-y| = |-x + (-y)| becomes x - y = |-(x +
y)| = x+y, which again isn’t possible unless y = 0. Thus, the only way to pick values for x and y that fit the
problem would be to pick a positive number for one variable and a negative number for the other. For
example:
5 – 2 = |3|
3 = 3
Likewise:
5 – 2 = |-3|
3 = 3
This second example also provides an objection to statement III: x + y = -3. Statements I and II must
therefore be true, and III can be false.
Question 13
13. How many different positive integer factors does the number (217)(34)(579) have?
(A) 5,372
(B) 5,530
(C) 6,800
(D) 7,200
(E) 27,000
Correct Answer: D
Step 2: The question asks for the number of different positive integer factors for the given number. Note
that this is not just the number of prime factors.
Step 3: Each positive integer factor of (217)(34)(579) must contain no more than 17 factors of 2, no more
than 4 factors of 3, and no more than 79 factors of 5. So each positive integer factor of (217)(34)(579)
must be of the form (2a)(3b)(5c), where a is an integer such that 0 ≤ a ≤ 17, b is an integer such that 0 ≤ b
≤ 4, and c is an integer such that 0 ≤ c ≤ 79. Since a is an integer greater than or equal to 0 and less than
or equal to 17, a can be one of the first 17 positive integers or 0. So there are 17 + 1 = 18 possible values
of a. Since b is an integer greater than or equal to 0 and less than or equal to 4, b can be one of the first
4 positive integers or 0. So there are 4 + 1 = 5 possible values of b. Since c is an integer greater than or
equal to 0 and less than or equal to 79, c can be one of the first 79 positive integers or 0. So there are 79
+ 1 = 80 possible values of c.
The number of different positive integer factors of (217)(34)(579), then, is 18 · 5 · 80 = 90 · 80 = 7,200.
Question 14
(A) 8
(B) 28
(C) 64
(D) 81
(E) 144
Correct Answer: B
Step 2: The question asks for an answer choice that is not a factor of that number. The remaining
answer choices will be factors.
Step 3: Since 1234 is too large to actually calculate, instead examine the prime factorization of the
number:
Step 4: Confirm that (C), (D), and (E) are factors as defined:
(C) 64 = 26
(D) 81 = 34
(E) 144 = 24 · 32
Question 15
15. If x is prime and nx is both the square of an integer and the cube of an integer, where n is a positive
!
integer, what is the greatest possible value of ?
!"
(A) 1
!
(B) !"
!
(C) !"
!
(D) !"
!
(E) !"#
Correct Answer: C
Step 2: There’s a lot of work to be done in simplifying this question stem. It is a property of fractions
!
that smaller denominators make larger fractions, so the greatest value of would require the smallest
!"
possible value of nx. Thus, the question is asking for the smallest possible value of nx.
Step 3: Since nx can be written as the product of two numbers, one of which is prime, it cannot be 1,
since 1 can only be written as 1x1, and 1 is not prime, eliminating (A). Backsolve the remaining answer
choices, starting with the smallest value of nx. 32 isn’t a perfect square, but 64 is both a square and a
cube (64 = 82 = 43). Choose (C).
Step 4: The only other answer choice that contains a denominator that is both a perfect square and
cube is (E) (729 = 272 = 93), but 1/729 is less than 1/64.
Question 16
(A) Statement (1) BY ITSELF is sufficient to answer the question, but statement (2) by itself is not.
(B) Statement (2) BY ITSELF is sufficient to answer the question, but statement (1) by itself is not.
(C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, even though
NEITHER statement BY ITSELF is sufficient.
(D) EITHER statement BY ITSELF is sufficient to answer the question.
(E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question, requiring more
data pertaining to the problem.
Correct Answer: E
Step 1: This is a yes/no question with a complicated exponential equation. The equation can be
simplified using exponent rules:
!!!! !!!
!=
!!
Word did not find any entries for your table of contents.
In your document, select the words to include in the table of contents, and then on the Home tab, under
Styles, click a heading style. Repeat for each heading that you want to include, and then insert the table
of contents in your document. To manually create a table of contents, on the Document Elements tab,
under Table of Contents, point to a style and then click the down arrow button. Click one of the styles
under Manual Table of Contents, and then type the entries manually.
3!!! 9 ! 3!!! 3!!
!= ! + != ! + !
3 3 3 3
! = 3!!!!! + 3!!!! = 3! + 3 ! = 9 + 3 !
! − 9 = 3!
Step 2:
Statement 1: I. If n is between 10 and 20, then n – 9 is between 1 and 11. Thus, y could be 2 (32 = 9), but
it could be any fractional value between 0 and 2 (30 = 1), and could even be slightly larger than 2.
Statement 2: I. Without a value for n, there’s no way of knowing what y is, integer or otherwise.
Both statements together: I. There are still two possible values for y that are integers such that 3y is
between 1 and 11, exclusive: 31 = 3, 32 = 9. Maybe y is less than 2, but maybe y equals 2, which requires
a “sometimes yes, sometimes no” answer.
GM117