Let be the set of all integers of the form , where are mutually distinct whole numbers.
When all the elements of are arranged in ascending order, find the element.
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.
Let a < b < c , as they are distinct. It can be seen that { s } = 2 a + 2 b + 2 c are binary numbers. For example, the smallest s = 2 0 + 2 1 + 2 2 = 1 1 1 2 = 7 1 0 . When c = 2 , the number n of elements is: n = ( 2 2 ) = 1 ; when n = 3 , n = 1 + ( 3 2 ) = 4 and so on. This implies that:
when c = 8 ⇒ n = 1 + 3 + 6 + 1 0 + 1 5 + 2 1 + 2 8 = 8 4
The 8 4 t h element s 8 4 = 2 8 + 2 7 + 2 6 = 4 4 8 ,
and 8 5 t h element s 8 5 = 2 9 + 2 1 + 2 0 = 5 1 5
Similarly, when c = 9 and b = 5
⇒ n = 8 4 + ( 1 1 ) + ( 2 1 ) + ( 3 1 ) + ( 4 1 ) + ( 5 1 ) = 8 4 + 1 + 2 + 3 + 4 + 5 = 9 9
The 9 9 t h element s 9 9 = 2 9 + 2 5 + 2 4 = 5 6 0 ,
and 1 0 0 t h element s 1 0 0 = 2 9 + 2 6 + 2 0 = 5 7 7