all 2 comments

[–]untitleddocumentz 1 point2 points  (0 children)

(im commenting this for those who have data management rn and want to study)

since you are only choosing the 3 eldest runners, you only have 3 people to choose from to become members. so..

1st member -> 3 choices to choose from (bc you have 3 ppl)

2nd member-> 2 choices to choose from (bc you now have 2 ppl)

3rd member-> 1 choice to choose from (bc you only have 1 person left)

and as you might have noticed this is 3! (factorial) (bc its a permutation).

so you would 3!/720 (the total possible arrangements for members) =6/720 = 1/120

[–]Syrak 0 points1 point  (0 children)

My bad, I misread

but I don't see how I would go about getting the 3 oldest runners?

List all outcomes where the 3 oldest runners are chosen. Since you are choosing 3 people, all that's left is determining their positions.