Since this is a combination not a permutation problem, (order does not matter) you should use the "n choose k" formula.
C=n!/(k!(n-k)!) where C is the number of unique combinations, n equals the total number of possible choices and k equals the specific number of choices. In this case:
C=9!/(4!(9-4)!)
C=9!/(4!5!)
C=362880/(24*120)
C=362880/2880
C=126
So there are 126 unique ways to pick 4 people from a group of 9 people.
Ummmm....
one hundred thousands place
i don't get what u mean by it
First find the lowest common multiple of the denominators which are 12 3 9 and 27 these all go into 108. Next divide 108 by the original denominators for example 108/12 is 9 then times 9 by the numerator which is 5 and you get 45 so the first one is 45/108. Do this for them all and order by the size of the numerator
