Last visit was: 18 Nov 2025, 14:11 It is currently 18 Nov 2025, 14:11
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
parkhydel
Joined: 03 Jun 2019
Last visit: 27 Mar 2025
Posts: 273
Own Kudos:
Given Kudos: 60
Posts: 273
Kudos: 20,383
 [366]
22
Kudos
Add Kudos
342
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,331
 [80]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,331
 [80]
42
Kudos
Add Kudos
38
Bookmarks
Bookmark this Post
User avatar
lacktutor
Joined: 25 Jul 2018
Last visit: 23 Oct 2023
Posts: 660
Own Kudos:
1,395
 [49]
Given Kudos: 69
Posts: 660
Kudos: 1,395
 [49]
37
Kudos
Add Kudos
12
Bookmarks
Bookmark this Post
User avatar
nick1816
User avatar
Retired Moderator
Joined: 19 Oct 2018
Last visit: 06 Nov 2025
Posts: 1,849
Own Kudos:
8,235
 [20]
Given Kudos: 707
Location: India
Posts: 1,849
Kudos: 8,235
 [20]
8
Kudos
Add Kudos
12
Bookmarks
Bookmark this Post
Maximum number of 2's in 9! = \([\frac{9}{2}]+[\frac{9}{2^2}]+[\frac{9}{2^3}] = 7\)

Maximum number of 3's in 9! = \([\frac{9}{3}]+[\frac{9}{3^2}] = 4\)

We can write 9! as \(2^7*3^4*5*7\)

\(n = [2^7*3^4*5*7] - [2^4*3^4]\)

\(n = 2^4*3^4 [5*7*8 - 1]\)

\(n = 2^4*3^4 [279]\)

\(n= 2^4*3^4 [9*31]\)

\(n = 2^4*3^6*31\)

D

parkhydel
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


PS66661.02
General Discussion
User avatar
MentoroniStudents
Joined: 18 May 2021
Last visit: 30 Nov 2024
Posts: 36
Own Kudos:
Given Kudos: 2
Affiliations: MBA Mentor
Location: India
Posts: 36
Kudos: 30
Kudos
Add Kudos
Bookmarks
Bookmark this Post
The idea is to see how many '3's are there is the equation: 9! – 6^4

9*8*7*6*5*4*3*2 - 3*2*3*2*3*2*3*2 = 3*3*2*2*2*7*3*2*5*2*2*3*2 = 3^4 * 2^4 (7*5*2*2*2 - 1) = 3^4 * 2^4 (280-1) = 3^4 * 2^4 (279) = 3^4 * 2^4 (3*3*31) = 3^6 * 2^4 * 31

6 is the answer (Answer: D)

Give Kudos if you like the explanation.

Regards,
Mentoroni . com
Top MBA students meet MBA aspirants
_________________
Mentoroni. com
Top MBA students meet MBA aspirants
avatar
TarunKumar1234
Joined: 14 Jul 2020
Last visit: 28 Feb 2024
Posts: 1,107
Own Kudos:
1,348
 [1]
Given Kudos: 351
Location: India
Posts: 1,107
Kudos: 1,348
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
If n=9!–6^4, which of the following is the greatest integer k such that 3^k is a factor of n ?

Now, n=9!–6^4 = 9*8*7*..... - 3^4*2^4 = 3^4 (8*7*2*5*4*2*1 - 2^4) = 3^4* 2^4 (7*5*8-1) = 3^4* 2^4* 279 = 3^4* 2^4*(3*3*31)

So, I think D. :)
User avatar
w4rlk
User avatar
Current Student
Joined: 25 Dec 2017
Last visit: 05 Mar 2023
Posts: 15
Own Kudos:
40
 [3]
Given Kudos: 163
Location: Saudi Arabia
GMAT 1: 710 Q49 V40
GMAT 2: 700 Q48 V38
GMAT 3: 710 Q49 V39
GPA: 3.5
WE:Project Management (Energy)
Products:
GMAT 3: 710 Q49 V39
Posts: 15
Kudos: 40
 [3]
2
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
n=9!-(6^4)

9!=9x8x7x6x5x4x3x2
9!=6x6x6x6x8x7x5
9!=(6^4)x280

n=[(6^4)x280] - (6^4)
n=(6^4)(280-1)
n=(2^4)(3^4)(279)
n=(2^4)(3^4)(3^2)(13)
n=(2^4)(3^6)(13)

Therefore greatest integer k=6
User avatar
errorlogger
Joined: 01 Nov 2020
Last visit: 31 Jan 2022
Posts: 82
Own Kudos:
Given Kudos: 52
Posts: 82
Kudos: 86
Kudos
Add Kudos
Bookmarks
Bookmark this Post
parkhydel
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


PS66661.02



chetan2u, IanStewart:
Please help me understand what is wrong with my approach?
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,331
 [4]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,331
 [4]
3
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
errorlogger
parkhydel
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


PS66661.02



chetan2u, IanStewart:
Please help me understand what is wrong with my approach?

One way to see the error is to try solving a similar question using this technique used...

If n = 20 - 11, what is the greatest integer k such that \(3^k\) is a factor of n?
There are zero 3's in the factorization of 20, and there are zero 3's in the factorization of 11.
So, applying your technique, the number of 3's in the factorization of 20 - 11 equals 0 - 0, which is not the case
User avatar
errorlogger
Joined: 01 Nov 2020
Last visit: 31 Jan 2022
Posts: 82
Own Kudos:
Given Kudos: 52
Posts: 82
Kudos: 86
Kudos
Add Kudos
Bookmarks
Bookmark this Post
BrentGMATPrepNow
errorlogger
parkhydel
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


PS66661.02



chetan2u, IanStewart:
Please help me understand what is wrong with my approach?

One way to see the error is to try solving a similar question using this technique used...

If n = 20 - 11, what is the greatest integer k such that \(3^k\) is a factor of n?
There are zero 3's in the factorization of 20, and there are zero 3's in the factorization of 11.
So, applying your technique, the number of 3's in the factorization of 20 - 11 equals 0 - 0, which is not the case

Hey BrentGMATPrepNow,
thanks for the quick revert.
However, I still don't get what is wrong with the approach. As per the little knowledge that I have, I believe the number of 3's can be found out using the method that I have shown. It only applies to factorials not normal numbers.
For ex: 3! will have one 3
9! will have 9/3 = 3 + 9/9 = 1, four 3's.
I know I'm wrong somewhere but still struggling to find it. Thanks again!

After re-reading your explanation, I guess you are referring to the split up that I have done and that is the root cause?
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,331
 [1]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,331
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
errorlogger

Hey BrentGMATPrepNow,
thanks for the quick revert.
However, I still don't get what is wrong with the approach. As per the little knowledge that I have, I believe the number of 3's can be found out using the method that I have shown. It only applies to factorials not normal numbers.
For ex: 3! will have one 3
9! will have 9/3 = 3 + 9/9 = 1, four 3's.
I know I'm wrong somewhere but still struggling to find it. Thanks again!

After re-reading your explanation, I guess you are referring to the split up that I have done and that is the root cause?


The approach doesn't work with factorials either.
The original question doesn't ask us to divide by 3^k. You inserted that in order to apply a technique for determining the number of 3's "hiding" in a number.

Here's an example to show that the approach doesn't work with factorials:
If n = 4! - 2!, what is the greatest integer k such that \(2^k\) is a factor of n?
There are 3 twos in the factorization of 4!, and there is 1 two in the factorization of 2!.
So, applying your technique, the number of 2's in 4! - 2! equals 3 - 1 = 2.
However, 4! - 2! = 22, and there's only 1 two in the factorization of 22
User avatar
IanStewart
User avatar
GMAT Tutor
Joined: 24 Jun 2008
Last visit: 16 Nov 2025
Posts: 4,145
Own Kudos:
10,983
 [3]
Given Kudos: 99
Expert
Expert reply
Posts: 4,145
Kudos: 10,983
 [3]
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
errorlogger

Please help me understand what is wrong with my approach?

Since 9! is divisible by 3^4, and 6^4 is divisible by 3^4, then you can be completely certain you'll be able to factor 3^4 out of 9! + 6^4, or from 9! - 6^4, or even from 9! + (11)(6^4), and so on. But all that proves is that we can divide 9! - 6^4 by at least 3^4. We might still be able to divide it by 3^5 or 3^6 or a higher power of 3, because new factors can show up when you add or subtract. For example, 27 and 54 are both divisible by 3^3, but when you add them, you get 81, which is divisible by 3^4.

So you've completed the first step of the problem, but then you genuinely need to factor out the 3^4 and see how many 3's you get in the brackets. Then you'll get the right answer.
User avatar
chetan2u
User avatar
GMAT Expert
Joined: 02 Aug 2009
Last visit: 15 Nov 2025
Posts: 11,238
Own Kudos:
43,696
 [1]
Given Kudos: 335
Status:Math and DI Expert
Location: India
Concentration: Human Resources, General Management
GMAT Focus 1: 735 Q90 V89 DI81
Products:
Expert
Expert reply
GMAT Focus 1: 735 Q90 V89 DI81
Posts: 11,238
Kudos: 43,696
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
errorlogger
parkhydel
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


PS66661.02



chetan2u, IanStewart:
Please help me understand what is wrong with my approach?


Hi,

You already have the relevant answers by experts above.

Whenever you are looking at remainders or other properties, tackle the entire expression rather than individual terms in it.
Adding the term may lead to an extra 3 or lesser number of 3s too.

Example:
3^4+6 will have only 3^1 as its factor.
While 3^3+6^3 may have 3^3 as factors of each terms - 3^3 and 6^3, when combined they give you 2 extra 3s, that is even 3^5 is a factor.
User avatar
gauravjain0211
Joined: 19 Jan 2017
Last visit: 17 Nov 2025
Posts: 15
Own Kudos:
Given Kudos: 14
Posts: 15
Kudos: 7
Kudos
Add Kudos
Bookmarks
Bookmark this Post
parkhydel
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


PS66661.02

What leads to error in such a problem - your confidence cause you already know the concept involved in calculation of the power of 3 in a factorial (too easy to solve right, except it isn't)

so yes 9! is div by at max 3^4, but that subtraction must induce a suspicion and persuade you to double check (cause even when individual numbers don't have 3 in them as a factor, their addition or subtraction may lead to a multiple of 3 for eg - (11-2)

So now factorial is not too big so open and do the exact calculation

1*2*3*4*5*6*7*8*9 - 6^4

6^4 (1*5*7*8 - 1) (cause 2*3*4*9 = 6^3)

6^4 (280-1)
6^4 (279)
6^4 (31*9)
6^4(31*3^2)

hence 3^6 can divide it, hence k = 6
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 18 Nov 2025
Posts: 16,265
Own Kudos:
Given Kudos: 482
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,265
Kudos: 76,980
Kudos
Add Kudos
Bookmarks
Bookmark this Post
parkhydel
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


PS66661.02

Keep in mind that addition or subtraction of terms can bring in new factors which don't exist in the two terms.
For example, if a and b are co-prime such as 3 and 5, 6a ( = 18) and 6b (= 30) have only one 2 each.

But \(6a + 6b = 6(a+b) = 6 * (3 + 5) = 6 * 8\) has four 2s.

Similarly, \((3^4 * 10 - 3^4)\) has only four 3s in each term but their subtraction leads to two more 3s.
\(3^4 (10 - 1) = 3^4 * 9\)

Hence, the only trick in these questions is to calculate what is obtained by the addition/subtraction and find its factors.
User avatar
jaydavido
Joined: 13 Dec 2022
Last visit: 31 Jul 2023
Posts: 12
Given Kudos: 39
Posts: 12
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
BrentGMATPrepNow
parkhydel
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
The question is basically asking us to determine how many 3's we can factor out of \(9! – 6^4\)
This calls for some prime factorization!

--------------ASIDE---------------------------------------------------------------------------------------------------------------------------------
Here's a quick technique for finding the prime factorization of a factorial.

For this example, we'll find the prime factorization of 10!

First, I know that the prime numbers "hiding" in 10! will range from 2 to 7 (i.e., all primes less than or equal to 10), which means we can write: \(10! = (2^?)(3^?)(5^?)(7^?)\)
From here, I'll focus on one prime number at a time, starting with 2.
In 10!, we have:
1 2 hiding in 2
2 2's hiding in 4 (since 4 = 2x2)
1 2 hiding in 6 (since 6 = 2x3)
3 2's hiding in 8 (since 8 = 2x2x2)
1 2 hiding in 10 (since 10 = 2x5)
So, there's a total of 8 2's hiding in 10!, which means we can now write: \(10! = (2^8)(3^?)(5^?)(7^?)\)

Now let's focus on how many 3's are hiding in 10!.
We have:
1 3 hiding in 3
1 3 hiding in 6 (since 6 = 2x3)
2 3's hiding in 9 (since 9 = 3x3)
So, there's a total of 4 3's hiding in 10!, which means we can write: \(10! = (2^8)(3^4)(5^?)(7^?)\)

Onto the 5's:
1 5 hiding in 5
1 5 hiding in 10
So, there's a total of 2 5's hiding in 10!, which means we can write: \(10! = (2^8)(3^4)(5^2)(7^?)\)

Finally, we can see that there's exactly 1 7 hiding in 10!, which means we can write: \(10! = (2^8)(3^4)(5^2)(7^1)\)
-------BACK TO THE QUESTION---------------------------------------------------------------------------------------------------------------------


Following the same technique for \(9!\), we get: \(9! = (2^7)(3^4)(5^1)(7^1) = 2^7 \cdot 3^4 \cdot 5 \cdot 7 \)

Now let's find the prime factorization of \(6^4\) to get: \(6^4 = (2 \cdot 3)^4 = 2^4 \cdot 3^4\)

So, we have: \(n = 9! – 6^4\) \(= 2^7 \cdot 3^4 \cdot 5 \cdot 7 - 2^4 \cdot 3^4\)

Factor the right side to get: \(= 2^4 \cdot 3^4(2^3 \cdot 5 \cdot 7 - 1)\)

Evaluate the part in parentheses: \(= 2^4 \cdot 3^4(279)\)

Find the prime factorization of the part in parentheses: \(= 2^4 \cdot 3^4(3^2 \cdot 31)\)

Simplify one last time: \(= 2^4 \cdot 3^6 \cdot 31\)

So, in total, we can factor six 3's out of \(9! – 6^4\)

Answer: D

Cheers,
Brent

hi, I know this will sound stupid, put what do you mean with factoring the right side, I really dont know how to do that, can u explain?
Gmatguy007
Joined: 31 Dec 1969
Last visit: -
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
w4rlk
n=9!-(6^4)

9!=9x8x7x6x5x4x3x2
9!=6x6x6x6x8x7x5
9!=(6^4)x280

n=[(6^4)x280] - (6^4)
n=(6^4)(280-1)
n=(2^4)(3^4)(279)
n=(2^4)(3^4)(3^2)(13)
n=(2^4)(3^6)(13)

Therefore greatest integer k=6

Could you clarify how you derived 9! as 6x6x6x6x8x7x5 from 9x8x7x6x5x4x3x2? Also, in the highlighted text, should it not be 3^2 * 31 since 31 multiplied by 9 equals 279?

I also arrived at k = 6, but my method was as follows: I identified the multiples of 3 (since we're looking for 3^k) within 9! and divided each by 3 to determine the number of 3s present in them.

9 divided by 3 equals 3,
6 divided by 3 equals 2,
3 divided by 3 equals 1.

Summing 3+2+1 yields 6, which equals k.

Is this method correct?
User avatar
nekr0
Joined: 10 Jul 2022
Last visit: 24 Aug 2025
Posts: 5
Own Kudos:
9
 [1]
Given Kudos: 17
Location: India
Posts: 5
Kudos: 9
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Gmatguy007
w4rlk
n=9!-(6^4)

9!=9x8x7x6x5x4x3x2
9!=6x6x6x6x8x7x5
9!=(6^4)x280

n=[(6^4)x280] - (6^4)
n=(6^4)(280-1)
n=(2^4)(3^4)(279)
n=(2^4)(3^4)(3^2)(13)
n=(2^4)(3^6)(13)

Therefore greatest integer k=6

Could you clarify how you derived 9! as 6x6x6x6x8x7x5 from 9x8x7x6x5x4x3x2? Also, in the highlighted text, should it not be 3^2 * 31 since 31 multiplied by 9 equals 279?

I also arrived at k = 6, but my method was as follows: I identified the multiples of 3 (since we're looking for 3^k) within 9! and divided each by 3 to determine the number of 3s present in them.

9 divided by 3 equals 3,
6 divided by 3 equals 2,
3 divided by 3 equals 1.

Summing 3+2+1 yields 6, which equals k.

Is this method correct?

Prime factorise 9! and it'll generate \((3^4)(2^7)(7*5)\) = \((3^4 * 2^4) * (2^3) * (7 * 5)\) = \((3 * 2)^4 * (8 * 7 * 5)\) = \(6^4 * 280\).

As for the last part - yes, it should've been \((3^2 * 31)\) and '13' is a typo, but it wouldn't affect the results as both are primes.

n = \(9! – 6^4\)
n = \([(6^4)*280] - (6^4)\)
n = \((6^4)(280-1)\)
n = \((2^4)(3^4)(279)\)
n = \((2^4)(3^4)(3^2 * 31)\)
n = \(2^4 *(3^4)(3^2) *31\)
n = \((3^6) * 2^4 * 31\)



Thus, k(max) = 6
User avatar
thekingslay
Joined: 30 Mar 2021
Last visit: 17 Nov 2025
Posts: 83
Own Kudos:
Given Kudos: 146
GMAT 1: 720 Q56 V50
GMAT 1: 720 Q56 V50
Posts: 83
Kudos: 18
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Solution-

9!-6^4/3
or, rewriting - 9/3 - 6^4/3 - quotients are 3 and 2
then, 9/3^2 - 6*6*6*6/3^2 - quotients are 1 and 1
then, 9/3^3 can not be solved, so focusing on 6*6*6*6/3^3 - quotient is 1
then, 6*6*6*6/3^4 - quotient is 1.
so the final power to solve this is 2 (from the first part)+4(from the other part) = 6
User avatar
sagar123450909
Joined: 02 Oct 2024
Last visit: 16 Nov 2025
Posts: 5
Given Kudos: 92
Products:
Posts: 5
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
n = 9! - 6^4

= 9*8*7*6*5*4*3*2 - 6^4

= 3*3*2*2*2*7*6*5*4*3*2 - 6^4

= 6^4 (2*7*5*4 - 1)

= 6^4 (280-1)

= 6^4 (279)

= 6^4*3*3(31)

= 3^6 * 2^4 * 31

Hence greatest integer k such that n is divisible 3^k is 6
 1   2   
Moderators:
Math Expert
105355 posts
Tuck School Moderator
805 posts