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 Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
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 Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget 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.

Probability glitch!

Expert replies
by ajas » Sun Apr 18, 2010 9:57 am
Can someone please solve and explain the following question to me?

At a dinner party 5 people are to be seated around a circular table. Two seating arragements are considered different only when the positions of the people are different relative to each other.what is the total number of different possible seating arrangements for the group?

A. 5
B. 10
C. 24
D. 32
E. 120

Thanks!
Join the discussion
Source: — Problem Solving |

by eaakbari » Sun Apr 18, 2010 10:25 am
Circular permutation = (n-1)!
= 4!
= 24
Answer C
Last edited by eaakbari on Sun Apr 18, 2010 1:07 pm, edited 1 time in total.
Whether you think you can or can't, you're right.
- Henry Ford
Join the discussion

by chrsrook » Sun Apr 18, 2010 12:48 pm
circulation permutation- n!/n

5!/5=24

C

Thanks
Join the discussion

by ajas » Sun Apr 18, 2010 2:35 pm
thanks both of you!
Join the discussion

by tanviet » Sun Apr 18, 2010 11:22 pm
Please, help

for circular permutation. How do we have

(N-1)!
Join the discussion

by liferocks » Sun Apr 18, 2010 11:24 pm
duongthang wrote:Please, help

for circular permutation. How do we have

(N-1)!
good explanation is provided here.Please check
https://www.beatthegmat.com/circular-per ... tml#241159
Join the discussion

by ajith » Sun Apr 18, 2010 11:27 pm
duongthang wrote:Please, help

for circular permutation. How do we have

(N-1)!

Say we want to arrange A B C in normal permutation

ABC ACB BAC BCA CAB CBA - There are 6 ways to arrange A B C

or n! ways (n being 3)

Now in a circular permutation ABC, BCA and CAB are the same
Also ACB, CBA and BAC are the same (because it is circular and hence the start and the end doesnt matter the order matters)

There are only 2 permuations

or (n-1)! (n being 2)

That's one way to explain why (n-1)!
Always borrow money from a pessimist, he doesn't expect to be paid back.
Join the discussion

by eaakbari » Mon Apr 19, 2010 12:34 am
When you arrange n objects linearly you have n!
When you arrange them in a circular fashion, that time abc is the same thing as cba when n = 3.
In general you will have n number of redundancies because of circular perm.

Hence for circular = n!/n = (n-1)!
Whether you think you can or can't, you're right.
- Henry Ford
Join the discussion