Last visit was: 16 Sep 2024, 22:02 It is currently 16 Sep 2024, 22:02
Toolkit
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

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.

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

SORT BY:
Tags:
Show Tags
Hide Tags
Manager
Joined: 02 Mar 2017
Posts: 228
Own Kudos [?]: 694 [37]
Given Kudos: 30
Location: India
Concentration: Finance, Marketing
GMAT Club Legend
Joined: 12 Sep 2015
Posts: 6802
Own Kudos [?]: 31334 [15]
Given Kudos: 799
General Discussion
GMAT Club Legend
Joined: 12 Sep 2015
Posts: 6802
Own Kudos [?]: 31334 [4]
Given Kudos: 799
Target Test Prep Representative
Joined: 14 Oct 2015
Status:Founder & CEO
Affiliations: Target Test Prep
Posts: 19462
Own Kudos [?]: 23262 [2]
Given Kudos: 286
Location: United States (CA)
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink]
1
Kudos
1
Bookmarks
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.

UNC Kenan Flagler Moderator
Joined: 18 Jul 2015
Posts: 237
Own Kudos [?]: 263 [1]
Given Kudos: 120
GMAT 1: 530 Q43 V20
WE:Analyst (Consumer Products)
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink]
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)
SVP
Joined: 26 Mar 2013
Posts: 2455
Own Kudos [?]: 1390 [0]
Given Kudos: 641
Concentration: Operations, Strategy
Schools: Erasmus (II)
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink]
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

Hi Brent,

Can you show another approach?

What 'at least' mean?
GMAT Club Legend
Joined: 12 Sep 2015
Posts: 6802
Own Kudos [?]: 31334 [0]
Given Kudos: 799
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink]
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
Intern
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
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink]
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
GMAT Club Legend
Joined: 03 Jun 2019
Posts: 5366
Own Kudos [?]: 4370 [0]
Given Kudos: 161
Location: India
GMAT 1: 690 Q50 V34
WE:Engineering (Transportation)
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink]
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
Non-Human User
Joined: 09 Sep 2013
Posts: 34880
Own Kudos [?]: 881 [0]
Given Kudos: 0
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink]
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.
Re: A man 8 friends whom he wants to invite for dinner. The number of ways [#permalink]
Moderator:
Math Expert
95555 posts