Let $s _ { 1 } , s _ { 2 } \ldots , s _ { 101 }$ be 101 bit strings of length at most 9. Prove that there exist two strings, $s _ { i }$ and $s _ { j }$ where $i \neq j$ that contain the same number of $0 \text { 's }$ and the same number of $\text { 1's. }$ (For example, strings 001001 and 101000 contain the same number of $\text { 0's }$ and the same number of $\text { 1's. }$ )

Question

Quizplus · Accepted Answer

The Answer of Let $s _ { 1 } , s _ { 2 } \ldots , s _ { 101 }$ be 101 bit strings of length at most 9. Prove that there exist two strings, $s _ { i }$ and $s _ { j }$ where $i \neq j$ that contain the same number of $0 \text { 's }$ and the same number of $\text { 1's. }$ (For example, strings 001001 and 101000 contain the same number of $\text { 0's }$ and the same number of $\text { 1's. }$ )

Let s1,s2…,s101s _ { 1 } , s _ { 2 } \ldots , s _ { 101 }s1​,s2​…,s101​

Let $s _ { 1 } , s _ { 2 } \ldots , s _ { 101 }$