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
GMATBootcamp Starts Sep 21
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE BOOTCAMP

Live Online Bootcamp Class with Top GMAT Expert Chris Peckover

Sep 21 to Oct 9, 2026

Schedule
Mon to Fri · 7:00 to 10:00 PM ET
Included
Live classes + 6 months of TTP OnDemand
  • Boost your GMAT score in less than one month in a live online class
  • 6 months access to TTP OnDemand video courses included
View bootcamp & 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
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
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.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

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

birthday for dinner

Expert replies
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
Join the discussion
Source: — Problem Solving |

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.
Join the discussion

by thephoenix » Wed Jan 27, 2010 1:11 am
each person has 3 option
3*3*3*3*3*3=3^6=729
Join the discussion

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!
Join the discussion

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.
Join the discussion