It is currently 24 Feb 2018, 12:05

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

n=?

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Expert Post
Math Revolution GMAT Instructor
User avatar
D
Joined: 16 Aug 2015
Posts: 4908
GPA: 3.82
n=? [#permalink]

Show Tags

New post 28 Apr 2017, 00:32
Expert's post
1
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

  5% (low)

Question Stats:

91% (00:20) correct 9% (00:24) wrong based on 75 sessions

HideShow timer Statistics

n=?

1) 7 is a factor of n
2) n is a prime number
[Reveal] Spoiler: OA

_________________

MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
Find a 10% off coupon code for GMAT Club members.
“Receive 5 Math Questions & Solutions Daily”
Unlimited Access to over 120 free video lessons - try it yourself
See our Youtube demo

Senior Manager
Senior Manager
avatar
B
Joined: 06 Dec 2016
Posts: 253
n=? [#permalink]

Show Tags

New post 28 Apr 2017, 13:02
1 is insufficient because n could be any number that is divisible by 7
2 is insufficient because n could be 2, 3, 5 etc.

1 & 2 together is sufficient. n is 7.

The answer is C :-D
Expert Post
Math Revolution GMAT Instructor
User avatar
D
Joined: 16 Aug 2015
Posts: 4908
GPA: 3.82
Re: n=? [#permalink]

Show Tags

New post 30 Apr 2017, 17:08
==> In the original condition, there is 1 variable (n) and in order to match the number of variables to the number of equations, there must be 1 equation. Since there is 1 for con 1) and 1 for con 2), D is most likely to be the answer. For con 2), n=7, 14, hence not unique and not sufficient. For con 2), n=7, 11, hence not unique and not sufficient. By solving con 1) and con 2), you get n=7, hence it is unique and sufficient.

The answer is C.
Answer: C
_________________

MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
Find a 10% off coupon code for GMAT Club members.
“Receive 5 Math Questions & Solutions Daily”
Unlimited Access to over 120 free video lessons - try it yourself
See our Youtube demo

Manager
Manager
User avatar
S
Status: Gmat lover
Joined: 27 Mar 2017
Posts: 88
Location: India
Schools: IIMA , IIMA PGPX"18
GMAT 1: 710 Q49 V39
GPA: 3.91
Reviews Badge
Re: n=? [#permalink]

Show Tags

New post 18 May 2017, 03:39
n=?

1) 7 is a factor of n ;n can be 7,14,28 etc. hence insufficient

2) n is a prime number; n can be 2,3,5 etc. hence insufficient

But by combining both 1 and 2 we have n = 7 hence sufficient.
So answer is C
_________________

_________________
Rules for posting in verbal Gmat forum, read it before posting anything in verbal forum
Giving me + 1 kudos if my post is valuable with you :)

The more you like my post, the more you share to other's need.

“The great secret of true success, of true happiness, is this: the man or woman who asks for no return, the perfectly unselfish person, is the most successful.”
-Swami Vivekananda

Re: n=?   [#permalink] 18 May 2017, 03:39
Display posts from previous: Sort by

n=?

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.