It is currently 20 Nov 2018, 05:16
My Tests

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.

Let n = 11!. What is the smallest non-prime positive intege

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
Moderator
Moderator
User avatar
Joined: 18 Apr 2015
Posts: 4916
Followers: 74

Kudos [?]: 980 [0], given: 4506

CAT Tests
Let n = 11!. What is the smallest non-prime positive intege [#permalink] New post 07 Aug 2017, 12:26
Expert's post
00:00

Question Stats:

20% (01:02) correct 80% (02:14) wrong based on 10 sessions


Let n = 11!. What is the smallest non-prime positive integer that is not a factor of n?

enter your value


[Reveal] Spoiler: OA
26

_________________

Get the 2 FREE GREPrepclub Tests

1 KUDOS received
Director
Director
Joined: 03 Sep 2017
Posts: 521
Followers: 1

Kudos [?]: 327 [1] , given: 66

Re: Let n = 11!. What is the smallest non-prime positive intege [#permalink] New post 30 Sep 2017, 06:09
1
This post received
KUDOS
To find the smallest non-prime number that is not a factor of k!, we have to take the first prime number greater than k and multiply it by 2 (at least for k greater than 6)
In our case, the smallest prime number greater than 11 is 13, that multiplied by 2 becomes 26.

More generally, the idea is to find the smallest number that cannot be computed as the product of any set of numbers composing 11!. With the rule above, the procedure of checking every number from 12 on is made faster
Intern
Intern
Joined: 14 Jun 2018
Posts: 36
Followers: 0

Kudos [?]: 7 [0], given: 100

Re: Let n = 11!. What is the smallest non-prime positive intege [#permalink] New post 08 Jul 2018, 02:25
IlCreatore wrote:
To find the smallest non-prime number that is not a factor of k!, we have to take the first prime number greater than k and multiply it by 2 (at least for k greater than 6)
In our case, the smallest prime number greater than 11 is 13, that multiplied by 2 becomes 26.

More generally, the idea is to find the smallest number that cannot be computed as the product of any set of numbers composing 11!. With the rule above, the procedure of checking every number from 12 on is made faster


Could anyone please explain the general rule here for solving this kind of question when k>6?
1 KUDOS received
Intern
Intern
User avatar
Joined: 04 May 2017
Posts: 36
Followers: 0

Kudos [?]: 21 [1] , given: 6

Re: Let n = 11!. What is the smallest non-prime positive intege [#permalink] New post 10 Jul 2018, 02:46
1
This post received
KUDOS
m is non-integer -> m =a*b where a and b are primes in which one of them is not divisible by 11!. We must minimize a,b -> a=2, b=13 -> m=26.
_________________

Do not pray for an easy life, pray for the strength to endure a difficult one - Bruce Lee

Re: Let n = 11!. What is the smallest non-prime positive intege   [#permalink] 10 Jul 2018, 02:46
Display posts from previous: Sort by

Let n = 11!. What is the smallest non-prime positive intege

  Question banks Downloads My Bookmarks Reviews Important topics  


GRE Prep Club Forum Home| About| Terms and Conditions and Privacy Policy| GRE Prep Club Rules| Contact

Powered by phpBB © phpBB Group

Kindly note that the GRE® test is a registered trademark of the Educational Testing Service®, and this site has neither been reviewed nor endorsed by ETS®.