Find the number of ordered pairs ( a 1 , a 2 , a 3 , a 4 , a 5 , a 6 ) that satisfy this conditions
0 ≤ a 1 , a 2 , a 3 , a 4 , a 5 , a 6 ≤ 1 0
max ( a 1 , a 2 , a 3 , a 4 , a 5 ) < a 6 .
a 1 , a 2 , a 3 , a 4 , a 5 , and a 6 are distinct integer numbers.
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.
Problem Loading...
Note Loading...
Set Loading...
a 6 can be 5 , 6 , 7 , 8 , 9 , 1 0
When a 6 = 5 there are ( 5 5 ) = 1 possibilities are there for a 1 , a 2 , . . . , a 5
When a 6 = 6 there are ( 5 6 ) = 6 possibilities are there for a 1 , a 2 , . . . , a 5
When a 6 = 7 there are ( 5 7 ) = 2 1 possibilities are there for a 1 , a 2 , . . . , a 5
When a 6 = 8 there are ( 5 8 ) = 5 6 possibilities are there for a 1 , a 2 , . . . , a 5
When a 6 = 9 there are ( 5 9 ) = 1 2 6 possibilities are there for a 1 , a 2 , . . . , a 5
When a 6 = 1 0 there are ( 5 1 0 ) = 2 5 2 possibilities are there for a 1 , a 2 , . . . , a 5
Total number of selection 4 6 2
In any tuples a 1 → a 5 can arrange in 5 ! = 1 2 0 ways as they are distinct
So, number of ordered pairs are 1 2 0 × 4 6 2 = 5 5 4 4 0