TCP
October 22, 2024TIFR 2021
| Question 11 |
How many numbers in the range f0; 1; : : : ; 1365g have exactly four 1’s in their binary
representation? (Hint: 136510 is 101010101012, that is, 1365 = 210 + 28 + 26 + 24 + 22 + 20🙂
In the following, the binomial coefficient (n/k) counts the number of k-element subsetsof an n-element set.
representation? (Hint: 136510 is 101010101012, that is, 1365 = 210 + 28 + 26 + 24 + 22 + 20🙂
In the following, the binomial coefficient (n/k) counts the number of k-element subsetsof an n-element set.
| (6/4) | |
| (10/4) | |
| (10/4) + (8/3) + (6/2) + (5/1) | |
| (11/4) + (9/3) + (7/2) + (5/1) | |
| 1024 |
Correct Answer: D
Subscribe
Login
0 Comments