Dealing with factorials: Generalization

  • Thread starter Thread starter ms. confused
  • Start date Start date
  • Tags Tags
    Factorials
AI Thread Summary
The discussion revolves around calculating the number of different itineraries for an airline pilot over a 7-day period spent in various cities. The initial calculation yielded 420 possible itineraries based on the distribution of days across cities. When considering a scenario where the first and last days are fixed in Yellowknife, the problem simplifies to arranging 5 remaining days, resulting in 120 possible itineraries. The generalization presented indicates that for n days and x days in one city, the formula for itineraries is (n-x)!. This approach effectively clarifies how fixing days in one location impacts the overall itinerary options.
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!
 
I multiplied the values first without the error limit. Got 19.38. rounded it off to 2 significant figures since the given data has 2 significant figures. So = 19. For error I used the above formula. It comes out about 1.48. Now my question is. Should I write the answer as 19±1.5 (rounding 1.48 to 2 significant figures) OR should I write it as 19±1. So in short, should the error have same number of significant figures as the mean value or should it have the same number of decimal places as...
Thread 'Collision of a bullet on a rod-string system: query'
In this question, I have a question. I am NOT trying to solve it, but it is just a conceptual question. Consider the point on the rod, which connects the string and the rod. My question: just before and after the collision, is ANGULAR momentum CONSERVED about this point? Lets call the point which connects the string and rod as P. Why am I asking this? : it is clear from the scenario that the point of concern, which connects the string and the rod, moves in a circular path due to the string...
Thread 'A cylinder connected to a hanging mass'
Let's declare that for the cylinder, mass = M = 10 kg Radius = R = 4 m For the wall and the floor, Friction coeff = ##\mu## = 0.5 For the hanging mass, mass = m = 11 kg First, we divide the force according to their respective plane (x and y thing, correct me if I'm wrong) and according to which, cylinder or the hanging mass, they're working on. Force on the hanging mass $$mg - T = ma$$ Force(Cylinder) on y $$N_f + f_w - Mg = 0$$ Force(Cylinder) on x $$T + f_f - N_w = Ma$$ There's also...
Back
Top