If y is a positive integer, is y prime?
(1) y>4!
(2) 11!-12<y<11!-2
OA B
Source: Princeton Review
5-Day Free Trial
5-day free, full-access trial TTP
Available with Beat the GMAT members only code
MORE DETAILS
If y is a positive integer, is y prime?
This topic has expert replies
-
BTGmoderatorDC
- Moderator
- Posts: 7187
- Joined: Thu Sep 07, 2017 4:43 pm
- Followed by:23 members
-
jpcameron17
- Junior | Next Rank: 30 Posts
- Posts: 10
- Joined: Wed Feb 27, 2019 4:11 am
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
A prime number is a number whose factors a 1 and that number alone. For example, the number 11 is a prime number since its factors are only the numbers 1 and 11 (i.e. itself), whereas the number 12 is not a prime number since it has other factors besides 1 and 12 (e.g. 2, 3, 4, and 6).
(1) y>4!
This tells us that y is any number greater than 4!. Since the numbers greater than 4! include both prime and non-prime numbers, this statement is insufficient.
(2) y = 11!-12
This statement gives us the precise value of y (since we can calculate the numerical value of 11!-12), and thus determine whether y is prime. Statement (2) is therefore sufficient.
The answer is thus (B).
(1) y>4!
This tells us that y is any number greater than 4!. Since the numbers greater than 4! include both prime and non-prime numbers, this statement is insufficient.
(2) y = 11!-12
This statement gives us the precise value of y (since we can calculate the numerical value of 11!-12), and thus determine whether y is prime. Statement (2) is therefore sufficient.
The answer is thus (B).
GMAT/MBA Expert
-
Ian Stewart
- GMAT Instructor
- Posts: 2621
- Joined: Mon Jun 02, 2008 3:17 am
- Location: Montreal
- Thanked: 1090 times
- Followed by:355 members
- GMAT Score:780
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
This is a near-exact replica of an official question. Statement 1 is clearly not sufficient, because there is an infinite number of primes. I think Statement 2 is supposed to read:
11! - 12 < y < 11! - 2
That's also not sufficient, because each number in that interval has an obvious divisor. Take a random number in that range, say, 11! - 7. Well, 11! alone is divisible by 7, so 11! - 7 must also be divisible by 7 (we can factor out a 7 from each of the two numbers in that subtraction). The same is true for any other number in that interval, so there are no primes between 11! - 12 and 11! - 2, and we have enough information to give a 'no' answer to the question.
11! - 12 < y < 11! - 2
That's also not sufficient, because each number in that interval has an obvious divisor. Take a random number in that range, say, 11! - 7. Well, 11! alone is divisible by 7, so 11! - 7 must also be divisible by 7 (we can factor out a 7 from each of the two numbers in that subtraction). The same is true for any other number in that interval, so there are no primes between 11! - 12 and 11! - 2, and we have enough information to give a 'no' answer to the question.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com
ianstewartgmat.com
ianstewartgmat.com
