CS 131

Boston University

CS

### Question Description

Iβm stuck on a Mathematics question and need an explanation.

Just this single question on combinatoric structure course. Please help me to do so thank you!

### Unformatted Attachment Preview

## Final Answer

I solved it, please read:)

Assume there is some ideal loss-less compression algorithm π. Because it is a compression, there is

at least one π₯, denote it π₯0 , such that |π(π₯0 )| < |π₯0 |. Denote |π(π₯0 )| = π0 β β0 .

Consider the set π0 of all strings of the length not greater that π0 , this set is clearly finite. By ...