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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Re: If a number (N) is divisible by 33, what will be the minimum [#permalink]

Show Tags

01 Oct 2012, 05:57

1

This post received KUDOS

N is divisible by 33 ...

Prime factors of 33 are 3 x 11 ...

Therefore N has at the least one three and one eleven as its prime factors ..

Now N^k should be divisible by 27 i.e. 3 x 3 x 3

In order for N^K to be divisible by 27 , N^k must contain at least 3 three's .. In order for N^k to be DEFINITELY divisible by 27 it needs to have at least 3 3's as its prime factors .. we know that n has at least one 3 , therefore it needs three 3's , thus min possible value of k is 3 , and that would occur if n has exactly one three as one of its prime factor .. The max value for k would obviously be anything more than 3 uptil infinite ...

Therefore answer is 3 (C)
_________________

"When you want to succeed as bad as you want to breathe, then you’ll be successful.” - Eric Thomas

If a number (N) is divisible by 33, what will be the minimum value of k, such that Nk should definitely be divisible by 27?

1 2 3 4 6

I guess it should be N^k instead of Nk.

Given that N is divisible by 33=3*11. Now, in order N^k to be divisible by 27=3^3 then k must be at least 3 in order N^k to have enough 3's.

Answer: C.

Thanks as usual, Bunuel. Could you help me wrap my head around this some more?

So N is divisible by 3*11 and N^k is divisible by 3*3*3.

So why exactly does the minimum value for k only need to be 3? Could you possibly use some example values here?

N^k to be divisible by 3^3 should have 3^3 as a factor and since N has only one 3 in its prime factorization then k must be at least 3.
_________________

Re: If a number (N) is divisible by 33, what will be the minimum [#permalink]

Show Tags

04 Dec 2015, 12:10

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

Happy New Year everyone! Before I get started on this post, and well, restarted on this blog in general, I wanted to mention something. For the past several months...

It’s quickly approaching two years since I last wrote anything on this blog. A lot has happened since then. When I last posted, I had just gotten back from...

Happy 2017! Here is another update, 7 months later. With this pace I might add only one more post before the end of the GSB! However, I promised that...