Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: Recursion problem (Power set)

by lodin (Hermit)
on May 25, 2008 at 11:02 UTC ( [id://688394]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    s = { sum(y) = n | y in P(x) }

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://688394]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others pondering the Monastery: (None)
    As of 2024-04-25 01:21 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?

      No recent polls found