[Haskell-cafe] Can anyone help me with partition numbers?

[Cale Gibbard]

First of all, read this :)
http://haskell.org/hawiki/HomeworkHelp

There doesn't appear to be a list for Haskell homework help in the
list of mailing lists on haskell.org. If Jerzy knows more about one,
he might be able to provide some information there.

We'll be happy to help, but what have you already tried? This looks
just exactly like the problem text.

 - Cale

On 24/11/05, whoals (sent by Nabble.com) <lists at nabble.com> wrote:
>  A partition of a positive integer n is a representation of n as the sum of
> any number of positive integral parts. For example, there are 7 partitions
> of the number 5: 1+1+1+1+1, 1+1+1+2, 1+1+3, 1+2+2, 1+4, 2+3 and 5. Define a
> function parts which returns the list of distinct partitions of an integer
> n. For example, parts 4 =
> [[1,1,1,1],[1,1,2],[1,3],[2,2],[4]].
> ________________________________
>  Sent from the Haskell - Haskell-Cafe forum at Nabble.com.
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>
>