Last visit was: 06 Oct 2024, 09:41 It is currently 06 Oct 2024, 09:41
Decision Tracker
My Rewards
Unanswered
Active Topics
New posts
New comers' posts
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.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel

A man 8 friends whom he wants to invite for dinner. The number of ways

SORT BY:
Date
Kudos
Tags:
Find Similar Topics 
Show Tags
Hide Tags
User avatar
G
VyshakhR1995
Joined: 02 Mar 2017
Posts: 228
Own Kudos [?]: 697 [37]
Given Kudos: 30
Location: India
Concentration: Finance, Marketing
Send PM
A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink] A man 8 friends whom he wants to invite for dinner. The number of ways   27 Apr 2017, 06:35
2
Kudos
35
Bookmarks
00:00
A
B
C
D
E

Difficulty:

65% (hard)

Question Stats:

53% (01:42) correct 47% (01:14) wrong based on 317 sessions
Hide Show DIFFICULTY AND TIMER STATISTICS
A man 8 friends whom he wants to invite for dinner. The number of ways in which he can invite at least one of them is

A. 8
B. 255
C. 8! - 1
D. 256
E. 7

Source :Quantpdf­
ShowHide Answer
Official Answer
B
Most Helpful Reply
User avatar
L
BrentGMATPrepNow
GMAT Club Legend
GMAT Club Legend
Joined: 12 Sep 2015
Posts: 6797
Own Kudos [?]: 31557 [15]
Given Kudos: 799
Location: Canada
Send PM
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink] A man 8 friends whom he wants to invite for dinner. The number of ways   27 Apr 2017, 06:46
5
Kudos
10
Bookmarks
Expert Reply
Top Contributor
VyshakhR1995
A man 8 friends whom he wants to invite for dinner.The number of ways in which he can invite at least one of them is

A) 8
B) 255
C) 8!-1
D) 256
E) 7


Take the task of inviting friends and break it into stages.

ASIDE: Let's let A, B, C, D, E, F, G and H represent the 8 friends

Stage 1: Decide whether or not to invite friend A
You have 2 options: invite friend A or don't invite friend A
So, we can complete stage 1 in 2 ways

Stage 2: Decide whether or not to invite friend B
You have 2 options: invite friend B or don't invite friend B
So, we can complete stage 2 in 2 ways

Stage 3: Decide whether or not to invite friend C
So, we can complete stage 3 in 2 ways
.
.
.
Stage 8: Decide whether or not to invite friend H
So, we can complete stage 8 in 2 ways

By the Fundamental Counting Principle (FCP), we can complete all 8 stages (and create a guest list) in (2)(2)(2)(2)(2)(2)(2)(2) ways (= 256 ways)

NOTE: in these calculations, one of the possible outcomes is that ZERO friends are invited. The question says that AT LEAST ONE friend must come.
So, we must subtract this 1 outcome from our solution.

So, total number of ways to invite friends = 256 - 1 = 255

Answer:
Show Spoiler
B

Note: the FCP can be used to solve the MAJORITY of counting questions on the GMAT. So, be sure to learn it.

RELATED VIDEOS




General Discussion
User avatar
L
Mo2men
Joined: 26 Mar 2013
Posts: 2454
Own Kudos [?]: 1394 [0]
Given Kudos: 641
Concentration: Operations, Strategy
Schools: Erasmus (II)
Send PM
Reviews Badge
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink] A man 8 friends whom he wants to invite for dinner. The number of ways   28 Apr 2017, 04:08
GMATPrepNow
VyshakhR1995
A man 8 friends whom he wants to invite for dinner.The number of ways in which he can invite at least one of them is

A) 8
B) 255
C) 8!-1
D) 256
E) 7


Take the task of inviting friends and break it into stages.

ASIDE: Let's let A, B, C, D, E, F, G and H represent the 8 friends

Stage 1: Decide whether or not to invite friend A
You have 2 options: invite friend A or don't invite friend A
So, we can complete stage 1 in 2 ways

Stage 2: Decide whether or not to invite friend B
You have 2 options: invite friend B or don't invite friend B
So, we can complete stage 2 in 2 ways

Stage 3: Decide whether or not to invite friend C
So, we can complete stage 3 in 2 ways
.
.
.
Stage 8: Decide whether or not to invite friend H
So, we can complete stage 8 in 2 ways

By the Fundamental Counting Principle (FCP), we can complete all 8 stages (and create a guest list) in (2)(2)(2)(2)(2)(2)(2)(2) ways (= 256 ways)

NOTE: in these calculations, one of the possible outcomes is that ZERO friends are invited. The question says that AT LEAST ONE friend must come.
So, we must subtract this 1 outcome from our solution.

So, total number of ways to invite friends = 256 - 1 = 255

Answer:
Show Spoiler
B


Hi Brent,

Can you show another approach?

What 'at least' mean?
User avatar
L
BrentGMATPrepNow
GMAT Club Legend
GMAT Club Legend
Joined: 12 Sep 2015
Posts: 6797
Own Kudos [?]: 31557 [0]
Given Kudos: 799
Location: Canada
Send PM
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink] A man 8 friends whom he wants to invite for dinner. The number of ways   28 Apr 2017, 06:03
Expert Reply
Top Contributor
Mo2men

Hi Brent,

Can you show another approach?

What 'at least' mean?

"at least" means "greater than or equal to"

So, if I say that I own at least 3 guitars, then the number of guitars I own = 3 or 4 or 5 or 6....


Cheers,
Brent
User avatar
L
BrentGMATPrepNow
GMAT Club Legend
GMAT Club Legend
Joined: 12 Sep 2015
Posts: 6797
Own Kudos [?]: 31557 [4]
Given Kudos: 799
Location: Canada
Send PM
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink] A man 8 friends whom he wants to invite for dinner. The number of ways   28 Apr 2017, 06:09
2
Kudos
2
Bookmarks
Expert Reply
Top Contributor
VyshakhR1995
A man 8 friends whom he wants to invite for dinner.The number of ways in which he can invite at least one of them is

A) 8
B) 255
C) 8!-1
D) 256
E) 7

Another approach (for Mo2men :-D )

Number of ways to invite at least 1 friend = (# of ways to invite exactly 1 friend) + (# of ways to invite exactly 2 friends) + (# of ways to invite exactly 3 friends) + (# of ways to invite exactly 4 friends) + . . . . + (# of ways to invite exactly 8 friends)

Since the order in which we invite the friends does not matter, we can use COMBINATIONS.
For example, the number of ways to invite exactly 2 friends = 8C2
And the number of ways to invite exactly 3 friends = 8C3
etc.

So, the number of ways to invite at least 1 friend = 8C1 + 8C2 + 8C3 + . . . + 8C7 + 8C8
= 8 + 28 + 56 + 70 + 56 + 28 + 8 + 1
= 255

RELATED VIDEO
User avatar
L
ScottTargetTestPrep
Target Test Prep Representative
Joined: 14 Oct 2015
Status:Founder & CEO
Affiliations: Target Test Prep
Posts: 19562
Own Kudos [?]: 23446 [2]
Given Kudos: 287
Location: United States (CA)
Send PM
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink] A man 8 friends whom he wants to invite for dinner. The number of ways   02 May 2017, 16:51
1
Kudos
1
Bookmarks
Expert Reply
VyshakhR1995
A man 8 friends whom he wants to invite for dinner.The number of ways in which he can invite at least one of them is

A)8
B)255
C)8!-1
D)256
E)7

We can use the following equation:

Total number of ways to invite friends = number of ways to invite at least one friend - number of ways to invite zero friends.

The total number of ways the man can invite his friends is 2^8 since he can or cannot invite each friend. The number of ways to invite no friends is 1. Thus, the number of ways to invite at least one friend is 2^8 - 1 = 256 - 1 = 255.

Answer: B
avatar
B
kablayi
Joined: 05 Mar 2015
Posts: 26
Own Kudos [?]: 18 [0]
Given Kudos: 111
Location: Azerbaijan
GMAT 1: 530 Q42 V21
GMAT 2: 600 Q42 V31
GMAT 3: 700 Q47 V38
Send PM
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink] A man 8 friends whom he wants to invite for dinner. The number of ways   11 Aug 2018, 09:13
The question could be interpreted in another way. "If we will flip a coin 8 times what is the number of ways we get at least one tail"

When you flip a coin 8 times there are 2^8 different ways the result may come out. One of the possible results is to get 8 heads - HHHHHHHH. Now you can imagine tail is to invite a friend and head is not to invite. Getting 8 heads means not to invite any of them.

Therefore, all outcomes satisfy us except when we get eight heads. There is only one way to get 8 heads. So we deduct this one outcome from total number of possible outcomes
User avatar
P
Pritishd
UNC Kenan Flagler Moderator
Joined: 18 Jul 2015
Posts: 237
Own Kudos [?]: 264 [1]
Given Kudos: 120
GMAT 1: 530 Q43 V20
WE:Analyst (Consumer Packaged Goods)
Send PM
GMAT ToolKit User
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink] A man 8 friends whom he wants to invite for dinner. The number of ways   18 Aug 2019, 05:46
1
Kudos
VyshakhR1995
A man 8 friends whom he wants to invite for dinner. The number of ways in which he can invite at least one of them is

A)8
B)255
C)8!-1
D)256
E)7

Source :Quantpdf

An alternate approach for this question would be to find the subsets of a set with 8 entities.

Lets take a smaller set, say there were only 3 friends (A, B & C) then the ways to invite at least 1 would be A, B, C, AB, AC, BC and ABC (7 ways). This is \(2^n-1\) \([2^3-1 = 7]\) in terms of the formula to find the subset of a set with n entities. We subtracted 1 because \(2^n\) also includes an empty set, whereas we have been provided a constraint of at least 1.

Applying the same to the problem at hand, there are 8 friends, hence \(2^8-1 = 256-1 = 255\) (Ans B)
User avatar
L
Kinshook
GMAT Club Legend
GMAT Club Legend
Joined: 03 Jun 2019
Posts: 5380
Own Kudos [?]: 4417 [0]
Given Kudos: 161
Location: India
Schools: HBS '22 CBS '22 Wharton '22
GMAT 1: 690 Q50 V34
WE:Engineering (Transportation)
Send PM
Reviews Badge
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink] A man 8 friends whom he wants to invite for dinner. The number of ways   18 Aug 2019, 07:33
VyshakhR1995
A man 8 friends whom he wants to invite for dinner. The number of ways in which he can invite at least one of them is

A)8
B)255
C)8!-1
D)256
E)7

Source :Quantpdf

Given: A man 8 friends whom he wants to invite for dinner.

Asked: The number of ways in which he can invite at least one of them is

No of ways to invite at least 1 friends = \(^8C_1 + ^8C_2 + ^8C_3 + ^8C_4 + ^8C_5 + ^8C_6 + ^8C_7 + ^8C_8\)

\((1+x)^n = ^nC_0 x^0 + ^nC_1 x + ^nC_2 x^2 + ... + ^nC_r x^r +.... + ^nC_n x^n\)

n =8
\((1+x)^8 = ^8C_0 x^0 + ^8C_1 x + ^8C_2 x^2 + ... + ^8C_r x^r +.... + ^8C_8 x^n\)
When x =1
\(2^8 = 1 + ^8C_1 + ^8C_2 + ^8C_3 + ^8C_4 + ^8C_5 + ^8C_6 + ^8C_7 + ^8C_8\)
\(2^8 -1= ^8C_1 + ^8C_2 + ^8C_3 + ^8C_4 + ^8C_5 + ^8C_6 + ^8C_7 + ^8C_8 = 256-1 =255\)

IMO B
User avatar
bumpbot
Non-Human User
Joined: 09 Sep 2013
Posts: 35120
Own Kudos [?]: 890 [0]
Given Kudos: 0
Send PM
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink] A man 8 friends whom he wants to invite for dinner. The number of ways   10 May 2024, 11:01
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
GMAT Club Bot
gmatclubot
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink]
10 May 2024, 11:01
Moderator:
Bunuel
Math Expert
95948 posts