The order for five four bit values has about 6.91 bits of information. log_2(5!)=6.91 More relevant to the problem, the order for four five bit values has abo

The order for five four bit values has about 6.91 bits of information. log_2(5!)=6.91 More relevant to the problem, the order for four five bit values has about 4.59 bits of information (log_2(4!)=4.59). Not all of the sets actually have four numbers- many have duplicate numbers, like the list [1 1 2 3] is a set of numbers {1 2 3}- and that gets us down to 4.08 bits of information which is small enough to make this example work. At least that's how I understand this. I could be wrong.