If A , B , C , D and E are all integers satisfying 2 0 > A > B > C > D > E > 0 , how many different ways can the five variables be chosen?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
@Brian Charlesworth , we really liked your comment, and have converted it into a solution. If you subscribe to this solution, you will receive notifications about future comments.
If N ( a , b ) is the number of ways of choosing a positively increasing positive integers less than b + 1 , as described in the problem, for b = 1 9 . Then,
Using these formulae, N ( 5 , 1 9 ) = 1 1 6 2 8
[ This comment has been converted into a solution ]
Problem Loading...
Note Loading...
Set Loading...
For any 5 integers chosen from the set { 1 , 2 , 3 , 4 , . . . . , 1 9 } there is only one way of arranging them in descending order, thus the answer is ( 5 1 9 ) = 1 1 6 2 8 .