BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

factorial problem

Expert replies
by gmat009 » Mon Nov 17, 2008 10:15 am
I am not sure if this question has been discussed before.
I tried to search it but couldn't find.


Can someone explain me what this question is really asking for.
What exactly do we need to prove.
Attachments
Doc1.doc
(74.5 KiB) Downloaded 136 times
Join the discussion
Source: — Data Sufficiency |

by cramya » Mon Nov 17, 2008 3:10 pm
Its basically asking if k is prime or not. If k were prime then 1 and k would be the only factors and there would be no p a factor of k such that
1<p<k

Stmt I

k>4!
4!=24

If k=25 the answer is yes
If k = 29 the answer is no

INSUFF

Stmt II

13!+2<=k<=13!+13

Any number between 13!+2 and 13!+13 will always be non prime i.e they will have factors from 2-13 (write out 13! = 13*12*11*10*9*8*7*6*5*4*3*2*1 )

Once a number is divisible by 2,3,4...if u keep adding 2 or 3 or 4... it will always be divisible by it again

This tell us k is non prime and 1<p<k exists

B)

Hope this helps! Let me know if u still have questions
Join the discussion