BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
Live EA class + 6 months of EA OnDemand
  • Expert-led weekly online sessions
  • EA Masterclass access between classes
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

130-point score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions
Start free 5-day trial
Read 559 reviewsTarget Test Prep

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

birthday for dinner

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
User avatar
GMAT Instructor
Posts: 3650
Joined: Wed Jan 21, 2009 4:27 amFollowed by: 80 members
Location: India
Thanked: 267 times
GMAT Score:760
by sanju09 » Wed Jan 27, 2010 12:02 am
A man has to invite six of his friends on his birthday for dinner. He can send invitations by post, by phone, or by his servant. In how many ways can he send invitations to his friends so that each of his friends gets only one invitation?
(A) 120
(B) 216
(C) 360
(D) 720
(E) 729
The mind is everything. What you think you become. -Lord Buddha



Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001

www.manyagroup.com
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
User avatar
Legendary Member
Posts: 1275
Joined: Thu Sep 21, 2006 11:13 pmFollowed by: 2 members
Location: Arabian Sea
Thanked: 125 times

by ajith » Wed Jan 27, 2010 12:27 am
sanju09 wrote:A man has to invite six of his friends on his birthday for dinner. He can send invitations by post, by phone, or by his servant. In how many ways can he send invitations to his friends so that each of his friends gets only one invitation?
(A) 120
(B) 216
(C) 360
(D) 720
(E) 729
Each of the 6 friends can be invited in 3 ways, total number of ways = 3^6 = 729
Always borrow money from a pessimist, he doesn't expect to be paid back.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Legendary Member
Posts: 1560
Joined: Tue Nov 17, 2009 2:38 amFollowed by: 5 members
Thanked: 137 times

by thephoenix » Wed Jan 27, 2010 1:11 am
each person has 3 option
3*3*3*3*3*3=3^6=729
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Senior | Next Rank: 100 Posts
Posts: 39
Joined: Tue Oct 23, 2007 9:25 am
Thanked: 1 times
GMAT Score:600

by hai1 » Wed Jan 27, 2010 1:52 am
As the invitation can go only once, hence this is a permutation without repetetion.

My answer is: 6X5X4=120.

I am no expert, but this is just my answer!
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Legendary Member
Posts: 1275
Joined: Thu Sep 21, 2006 11:13 pmFollowed by: 2 members
Location: Arabian Sea
Thanked: 125 times

by ajith » Wed Jan 27, 2010 1:57 am
hai1 wrote:As the invitation can go only once, hence this is a permutation without repetetion.

My answer is: 6X5X4=120.

I am no expert, but this is just my answer!

Letter,Letter,Letter,Letter,Letter, Servant

Is different from

Servent,Letter,Letter,Letter,Letter,Letter

and each of the 6 slots can be filled by either 1 of the 3 options (phone, letter or servant)

so the total num of ways = 3*3*3*3*3*3
Always borrow money from a pessimist, he doesn't expect to be paid back.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1