-- Random Processes, Ch. 3, Prob. 3
--   Prove the power set has N^2 elements.
--
-- David Banas
-- 30 June 2011

module Main (main) where

import Data.RandProc

main = do
    foldl (>>)
        (putStrLn "Random Processes, Ch. 3, Prob. 3:")
        $ map (\(n, l) -> putStrLn $ "N: " ++ show n ++ ", length ps: " ++ show l)
            [ (n', length $ subs [1..n']) | n' <- [1..6] ]