Dealing with factorials: Generalization

  • Thread starter Thread starter ms. confused
  • Start date Start date
  • Tags Tags
    Factorials
Click For Summary
SUMMARY

The discussion focuses on calculating the number of possible itineraries for an airline pilot over a 7-day period, with specific days allocated to various cities: Winnipeg, Regina, Edmonton, and Yellowknife. The initial calculation yielded 420 itineraries using generalization. However, when fixing the first and last days in Yellowknife, the problem simplifies to arranging 5 days across the remaining cities, resulting in 120 possible itineraries. The general formula derived is (n-x)!, where n is the total days and x is the days spent in one city.

PREREQUISITES
  • Understanding of factorial notation (n!)
  • Basic combinatorial principles
  • Knowledge of permutations and arrangements
  • Familiarity with generalization in problem-solving
NEXT STEPS
  • Study the concept of permutations in combinatorics
  • Learn about the application of factorials in probability theory
  • Explore advanced combinatorial techniques for itinerary planning
  • Research generalization methods in mathematical problem-solving
USEFUL FOR

Mathematicians, educators, students studying combinatorics, and anyone interested in optimizing itinerary planning through mathematical principles.

ms. confused
Messages
90
Reaction score
0
The second part of this problem is giving me a hard time. I hope someone can help me with it:

An airline pilot reported her itinerary for 7 days. She spent 1 day in Winnipeg, 1 day in Regina, 2 days in Edmonton, and 3 days in Yellowknife.

a) how many different itineraries are possible?

Using generalization I got 420 (that being the answer for this part) so I'm OK with that but...

b) what difference would it make if the first day and the last day had been spent in Yellowknife?

What do I do? :eek:
 
Physics news on Phys.org
By fixing two of the days in Yellowknife, the problem reduces to:

An airline pilot reported her itinerary for 5 days. She spent 1 day in Winnipeg, 1 day in Regina, 2 days in Edmonton, and 1 day in Yellowknife.
 


For part b), the difference would be that the first and last day would be fixed in Yellowknife, leaving only 5 days to be spent in the other cities. Therefore, the number of possible itineraries would be 5! (5 factorial) which is equal to 120. So the total number of possible itineraries if the first and last day were spent in Yellowknife would be 120.

To generalize this, if there are n days in the itinerary and x days are spent in one city, then the number of possible itineraries would be (n-x)! as the remaining days can be arranged in any order.

In this case, n=7 and x=2, so the number of possible itineraries would be (7-2)! = 5! = 120.

Hope this helps!
 

Similar threads

Replies
21
Views
4K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 101 ·
4
Replies
101
Views
10K
  • · Replies 19 ·
Replies
19
Views
2K
Replies
1
Views
6K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 18 ·
Replies
18
Views
4K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 33 ·
2
Replies
33
Views
6K