[vox-tech] [OT] Binary Representation Challenge

[Alex Mandel <MAPStech_dev@wildintellect.com>]

I realize this might be not be a challenge for some of you.
--
I need to make a list of all possible permutations given 9 options and 
that you can choose any number of options at once.
I've figured out using nCr statistics that this is 511 choices, but now 
I need to represent them in 2^9 binary code: 000000001, 000000010 etc

Anyone got a quick way? I thought about writing a python code or 
something but then I got confused just thinking about the algorthim.

Now the best would be if you had an idea that I could implement with my 
limited toolset: R, OpenOffice, Python, and I guess I could add a 
package to Cygwin if necessary.

Thanks,
Alex

PS: WinXP box
_______________________________________________
vox-tech mailing list
vox-tech@lists.lugod.org
http://lists.lugod.org/mailman/listinfo/vox-tech