Bijektion: ungerade ↔ steigende
Hinweis:
split :: Int -> (Int, Int) split = undefined prop_split n = let (o, e) = split n in odd o && n == o * 2^e strict_to_odd :: Partition -> Partition strict_to_odd xs = Data.List.sort $ do x <- xs ; let ( o, e ) = split x k <- [ 1 .. 2^e ] ; return oÜbungsaufgabe:
odd_to_strict