@@ -55,7 +55,7 @@ This b-list structure shows that a fast random access in a list-like structure i

#### Exercise 3 : Skew binary number system

We call skew binary decomposition (or sb-decomposition) of a number its decomposition as sum of numbers of the form 2^k -1 with k>0. Moreover all the terms in this sum mut be differents, except possibly the two smallest ones.

We call skew binary decomposition (or sb-decomposition) of a number its decomposition as sum of numbers of the form 2^k -1 with k>0. Moreover all the terms in this sum must be differents, except possibly the two smallest ones.

- Write a `decomp` function computing a sb-decomposition for any natural number. Could we have different ordered sb-decompositions of the same number ?