<div dir="ltr">Although it was phrased as one, it wasn't. If it were a homework question, wouldn't you think that I'd be trained to do it or have a TA to ask?<br><br>But who said that you're accusing me of anything :) Thanks for your concern, Bulat.<br>
<br>\/\/<br><br><div class="gmail_quote">On Fri, Sep 10, 2010 at 1:47 AM, Bulat Ziganshin <span dir="ltr"><<a href="mailto:bulat.ziganshin@gmail.com">bulat.ziganshin@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
Hello Wanas,<br>
<div class="im"><br>
Friday, September 10, 2010, 12:55:14 AM, you wrote:<br>
> a) I want to write a function that generates lists of lists of<br>
> size $n$. All having the property that sum lst = sum [1..n].<br>
> a-1) After that, I want to remove all permutations. My idea of<br>
<br>
</div>you have very interesting questions. hopefully it was already answered<br>
at <a href="http://www.haskell.org/haskellwiki/Homework_help" target="_blank">http://www.haskell.org/haskellwiki/Homework_help</a><br>
<font color="#888888"><br>
<br>
--<br>
Best regards,<br>
Bulat mailto:<a href="mailto:Bulat.Ziganshin@gmail.com">Bulat.Ziganshin@gmail.com</a><br>
<br>
</font></blockquote></div><br></div>