l i n u x - u s e r s - g r o u p - o f - d a v i s
Next Meeting:
July 7: Social gathering
Next Installfest:
Latest News:
Jun. 14: June LUGOD meeting cancelled
Page last updated:
2005 Sep 20 14:55

The following is an archive of a post made to our 'vox-tech mailing list' by one of its subscribers.

Report this post as spam:

(Enter your email address)
[vox-tech] [OT] Binary Representation Challenge
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[vox-tech] [OT] Binary Representation Challenge

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.


PS: WinXP box
vox-tech mailing list

LUGOD Group on LinkedIn
Sign up for LUGOD event announcements
Your email address:
LUGOD Group on Facebook
'Like' LUGOD on Facebook:

Hosting provided by:
Sunset Systems
Sunset Systems offers preconfigured Linux systems, remote system administration and custom software development.

LUGOD: Linux Users' Group of Davis
PO Box 2082, Davis, CA 95617
Contact Us

LUGOD is a 501(c)7 non-profit organization
based in Davis, California
and serving the Sacramento area.
"Linux" is a trademark of Linus Torvalds.

Sponsored in part by:
Sunset Systems
Who graciously hosts our website & mailing lists!