GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 17 Oct 2018, 02:41

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

Mary persuaded n friends to donate $500 each to her election

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

Hide Tags

Intern
Intern
User avatar
Joined: 29 Mar 2013
Posts: 28
Schools: ISB '16
Re: Mary persuaded n friends to donate $500 each to her election  [#permalink]

Show Tags

New post 30 Mar 2015, 20:07
Bunuel wrote:
Awli wrote:
Mary persuaded n friends to donate $500 each to her election campaign, an then each of these n friends persuaded n more people to donate $500 each to Mary's campaign. If no one donated more than once and if there were no other donations, what was the value of n?

(1) The first n people donated \frac{1}{16} of the total amount donated.

(2) The total amount donated was $120,000


Merging topics. Please refer to the discussion on page 1.


[color=#0000ff]not sure, if my approach is right or wrong. I just took it like:
1. Mary persuaded n friends to donate $500 = n*500
2. then each of these n friends persuaded n more people.= n^(n+1) * 500

Statement 1. first n donated 1/16 of the total. remains > need total amount.
Statement 2. n^(n+1)*500 = 120,000
n*n^n = 240 .. Looks insufficient

1+2

n = 1/16 * 120000 /500 = 15

hence C
Intern
Intern
avatar
Joined: 04 Mar 2015
Posts: 4
Premium Member
Mary persuaded n friends to donate $500 each to her election  [#permalink]

Show Tags

New post 31 Mar 2015, 03:14
Ans: D
1st amount = 500n ( 500 people pay n amount)
2nd amount = 500n^2(n people employ n people which makes the number of people n^2 and each one of them pays 500)
total = 500n + 500 n^2

1st statment
500n = 1/16 * (500n + 500n^2)
n = 15 or 0 (n = 0 not possible)
hence sufficient

2nd statement
500n + 500n^2 = 120,000
=> n + n^2 = 240
=> n = 15 or -16 ( n = -16 not possible for obvious reasons :wink: )
hence sufficient
Intern
Intern
avatar
B
Joined: 06 Nov 2014
Posts: 5
GMAT ToolKit User
Re: Mary persuaded n friends to donate $500 each to her election  [#permalink]

Show Tags

New post 31 Mar 2015, 04:44
Original Donations = 500n
Friends' Friends =500n^2
Total = 500n+500n^2

Statement 1 :The first n people donated \frac{1}{16} of the total amount donated.

500n = 1/16 (500n+500n^2)
16(500n) = 500n+500n^2
n = 15
stmt 1 is sufficient

Statement 2: The total amount donated was $120,000

500n+500n^2=$120,000
can solve for n
n=15
stmt 2 is sufficient

Answer is D
Intern
Intern
avatar
Joined: 30 Jul 2014
Posts: 1
Re: Mary persuaded n friends to donate $500 each to her election  [#permalink]

Show Tags

New post 10 Aug 2015, 02:55
aalriy wrote:
I have understood the approach GT took to solve the problem its very similar to mine... but i cannot make out how can the first stmt give a solution for n as 0 or a -ve value.

Could someone explain this?



On the GMAT you ll not be asked a value based DS question if at all there is no such value.That is why n can not be zero.One more thing that U can understand that as there are n people first to donate $500 each and those n people refer n people each .So if U consider that there are 16 portions total money is donated by all then 1 portion is by the first n people.
Intern
Intern
User avatar
B
Joined: 16 May 2017
Posts: 21
Re: Mary persuaded n friends to donate $500 each to her election  [#permalink]

Show Tags

New post 22 May 2017, 09:57
Here we have given:

n*500 – number of people who initially donated
n(n*500) – persuaded number of people to donate.

so the total T = 500n + 500nsrd = 500(n + n sqrd)


(1) n*500 – (initial number of people donated) = 1/16, so here we have a fraction and we can solve for n => sufficient.
(2) We have total amount so we can again solve for n => sufficient.

The answer is D.
CEO
CEO
User avatar
D
Joined: 12 Sep 2015
Posts: 3000
Location: Canada
Re: Mary persuaded n friends to donate $500 each to her election  [#permalink]

Show Tags

New post 12 Nov 2017, 09:07
Top Contributor
seofah wrote:
Mary persuaded n friends to donate $500 each to her election campaign, and then each of these n friends persuaded n more people to donate $500 each to Mary’s campaign. If no one donated more than once and if there were no other donations, what was the value of n?

(1) The first n people donated 1/16 of the total amount donated.
(2) The total amount donated was $120,000.


Target question: What was the value of n?

When I scan the two statements, it seems that statement 2 is easier, so I'll start with that one first...

Statement 2: The total amount donated was $120,000
Let's summarize the given information....

First round: n friends donate 500 dollars.
This gives us a total of 500n dollars in this round

Second round: n friends persuade n friends each to donate
So, each of the n friends gets n more people to donate.
The total number of donors in this round = n²
This gives us a total of 500(n²) dollars in this round

TOTAL DONATIONS = 500n dollars + 500(n²) dollars
We can rewrite this: 500n² + 500n dollars

So, statement 2 tells us that 500n² + 500n = 120,000
This is a quadratic equation, so let's set it equal to zero to get: 500n² + 500n - 120,000 = 0
Factor out the 500 to get: 500(n² + n - 240) = 0
Factor more to get: 500(n + 16)(n - 15) = 0
So, EITHER n = -16 OR n = 15
Since n cannot be negative, it must be the case that n = 15
Since we can answer the target question with certainty, statement 2 is SUFFICIENT

Statement 1: The first n people donated 1/16 of the total amount donated.
First round donations = 500n
TOTAL donations = 500n² + 500n
So, we can write: 500n = (1/16)[500n² + 500n]
Multiply both sides by 16 to get: 8000n = 500n² + 500n
Set this quadratic equation equal to zero to get: 500n² - 7500n = 0
Factor to get: 500n(n - 15) = 0
Do, EITHER n = 0 OR n = 15
Since n cannot be zero, it must be the case that n = 15
Since we can answer the target question with certainty, statement 1 is SUFFICIENT

Answer:

Cheers,
Brent
_________________

Brent Hanneson – GMATPrepNow.com
Image
Sign up for our free Question of the Day emails

Intern
Intern
avatar
Joined: 16 Jan 2011
Posts: 4
Location: Singapore
Concentration: Finance
Schools: HKUST (S)
GMAT 1: 690 Q49 V34
GPA: 3.62
Mary persuaded n friends to donate $500 each to her election  [#permalink]

Show Tags

New post 22 Jun 2018, 23:07
[/quote]

You can solve it using the formula for quadratics, though it's better to use another approach:

\(500n+500n^2=120,000\) --> \(n+n^2=240\) --> \(n(n+1)=240\). Since \(n\) is an integer then we have that the product of two consecutive integers is 240, now it's easy to find that \(n=15\).

Hope it's clear.[/quote]

Within context of GMAT DS question, the moment I manage to set up such relationship n(n+1) = 240, will it be safe to say there is 1 solution for n without trying to find a pair of factors that fit? This would save some time. Whenever I get to this point, I always try to find a pair just to make sure it will not be the case of a) having no solution for n or b) having 2 solutions for n.
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 49948
Re: Mary persuaded n friends to donate $500 each to her election  [#permalink]

Show Tags

New post 22 Jun 2018, 23:23
gmatcrash wrote:
Within context of GMAT DS question, the moment I manage to set up such relationship n(n+1) = 240, will it be safe to say there is 1 solution for n without trying to find a pair of factors that fit? This would save some time. Whenever I get to this point, I always try to find a pair just to make sure it will not be the case of a) having no solution for n or b) having 2 solutions for n.


n(n + 1) = (positive number) will always have two solutions, one negative and one positive but not always these solutions will be integers.

For example:

n(n + 1) = 2 --> n = -2 or n = 1;

n(n + 1) = 2 --> \(n = -\frac{1}{2}-\frac{\sqrt{13}}{2}\) or \(n = -\frac{1}{2}+\frac{\sqrt{13}}{2}\)
_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | All You Need for Quant | PLEASE READ AND FOLLOW: 12 Rules for Posting!!!

Resources:
GMAT Math Book | Triangles | Polygons | Coordinate Geometry | Factorials | Circles | Number Theory | Remainders; 8. Overlapping Sets | PDF of Math Book; 10. Remainders | GMAT Prep Software Analysis | SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) | Tricky questions from previous years.

Collection of Questions:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
Extra-hard Quant Tests with Brilliant Analytics

GMAT Club Bot
Re: Mary persuaded n friends to donate $500 each to her election &nbs [#permalink] 22 Jun 2018, 23:23

Go to page   Previous    1   2   [ 28 posts ] 

Display posts from previous: Sort by

Mary persuaded n friends to donate $500 each to her election

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


Copyright

GMAT Club MBA Forum Home| About| Terms and Conditions and Privacy Policy| 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®.