Payal Tandon
Co-founder, e-GMAT
Welcome to e-GMAT Support!
I am Payal, Co-Founder of e-GMAT.
Feel free to ask any Query.
Thank you for your query.
We will be contacting you soon on

If n = 9! – 6^4, which of the following is the greatest integer k such that 3^k is a…

A 4 min read

If n = 9! – 6^4, which of the following is the greatest integer k such that 3^k is a factor of n?

  • A. 1
  • B. 3
  • C. 4
  • D. 6
  • E. 8

Solution:

  • Translate the problem requirements: We need to find the greatest integer k such that 3^k divides n, where n = 9! – 6^4. This means finding the highest power of 3 that is a factor of the result when we subtract 6^4 from 9!.
  • Calculate the prime factorization components: Find how many factors of 3 are in 9! and how many factors of 3 are in 6^4 separately.
  • Express both terms with their 3-factors extracted: Rewrite both 9! and 6^4 in the form (power of 3) Ɨ (number not divisible by 3) to clearly see the structure.
  • Factor out the common power of 3: Since we’re subtracting, factor out the highest common power of 3 from both terms to determine the final power of 3 in the difference.

Execution of Strategic Approach

  1. Translate the problem requirements Let’s break this down in plain English first. We have a number n that equals 9! minus 6^4. We want to find the biggest value of k where 3^k divides evenly into n. Think of it this way: if 3^k is a factor of n, that means we can divide n by 3^k and get a whole number with no remainder. We want the largest possible k for which this works. So our job is to find the highest power of 3 that “goes into” the result when we subtract 6^4 from 9!. Process Skill: TRANSLATE – Converting the mathematical language “greatest integer k such that 3^k is a factor of n” into understandable terms
  2. Calculate the prime factorization components Now let’s figure out how many factors of 3 are hiding in each piece separately. For 9!: We need to count how many times 3 appears as a factor in 9! = 9 Ɨ 8 Ɨ 7 Ɨ 6 Ɨ 5 Ɨ 4 Ɨ 3 Ɨ 2 Ɨ 1 Let’s look at each number:
  • 3 contributes one factor of 3
  • 6 = 2 Ɨ 3 contributes one factor of 3
  • 9 = 3 Ɨ 3 contributes two factors of 3 So 9! has 1 + 1 + 2 = 4 factors of 3 total. This means 9! = 3^4 Ɨ (some number not divisible by 3) For 6^4: Since 6 = 2 Ɨ 3, we have 6^4 = (2 Ɨ 3)^4 = 2^4 Ɨ 3^4 So 6^4 has exactly 4 factors of 3. This means 6^4 = 3^4 Ɨ 2^4 = 3^4 Ɨ 16
  1. Express both terms with their 3-factors extracted Now let’s write both pieces in a form that clearly shows their factors of 3. For 9!: We know 9! = 3^4 Ɨ m, where m is some integer not divisible by 3 To find m: 9! = 362,880 and 3^4 = 81, so m = 362,880 Ć· 81 = 4,480 We can verify: 4,480 is not divisible by 3 (4 + 4 + 8 + 0 = 16, and 16 is not divisible by 3) For 6^4: We already found 6^4 = 3^4 Ɨ 16 So our expression becomes: n = 9! – 6^4 = 3^4 Ɨ 4,480 – 3^4 Ɨ 16
  2. Factor out the common power of 3 Since both terms have 3^4 as a factor, we can factor it out: n = 3^4 Ɨ 4,480 – 3^4 Ɨ 16 n = 3^4 Ɨ (4,480 – 16) n = 3^4 Ɨ 4,464 Now we need to check if 4,464 has any additional factors of 3: 4,464 Ć· 3 = 1,488 1,488 Ć· 3 = 496 496 Ć· 3 = 165.33… (not a whole number) So 4,464 = 3^2 Ɨ 496, and 496 is not divisible by 3. Therefore: n = 3^4 Ɨ 3^2 Ɨ 496 = 3^6 Ɨ 496 Since 496 is not divisible by 3, the highest power of 3 that divides n is 3^6. Process Skill: MANIPULATE – Factoring out common terms and systematically checking for additional factors Final Answer The greatest integer k such that 3^k is a factor of n is k = 6. Looking at our answer choices, this corresponds to choice D.

Common Faltering Points

Errors while devising the approach

  1. Misunderstanding what “factor” means in the context Students might confuse “3^k is a factor of n” with “n is a factor of 3^k” or think they need to find how many times they can multiply 3^k to get n, rather than understanding they need to find the highest power of 3 that divides evenly into n.
  2. Attempting to calculate n directly first Many students will try to compute 9! = 362,880 and 6^4 = 1,296, then subtract to get n = 361,584, and then try to factor this large number. This approach is much more time-consuming and error-prone compared to working with prime factorizations from the start.
  3. Forgetting to use the subtraction structure strategically Students might calculate the powers of 3 in 9! and 6^4 separately but fail to recognize that since both terms have the same power of 3 (3^4), they can factor this out to simplify the problem significantly.

Errors while executing the approach

  1. Incorrectly counting factors of 3 in 9! When finding factors of 3 in 9!, students often miss that 9 = 3^2 contributes TWO factors of 3, not just one. They might count only 3, 6, and 9 as contributing one factor each, getting 3 total instead of the correct 4 factors.
  2. Arithmetic errors when checking divisibility When determining if 4,464 has additional factors of 3, students might make division errors or stop checking too early. For example, they might incorrectly calculate 4,464 Ć· 3 or fail to continue dividing 1,488 by 3 to find the second additional factor.
  3. Incorrectly handling the factorization of 6^4 Students might write 6^4 as having 4 factors of 6 rather than recognizing that 6 = 2 Ɨ 3, so 6^4 = (2 Ɨ 3)^4 = 2^4 Ɨ 3^4, leading to wrong counts of factors of 3.

Errors while selecting the answer

  1. Adding instead of using the highest power After finding that 9! has 4 factors of 3 and 6^4 has 4 factors of 3, students might incorrectly think the answer is 4 + 4 = 8, not recognizing that the subtraction and factoring process changes how the powers combine.
  2. Forgetting to account for additional factors in the difference Students might correctly factor out 3^4 from both terms but then forget to check whether (4,480 – 16) = 4,464 contains additional factors of 3, stopping at k = 4 instead of the correct k = 6.

About The Author