[CASH REWARD] Looking for a program which can help me find endless combinations of numbers.

[etalns]

I'd like a program if anyone can find it that will give me an endless amount of combinations.

For instance, if I put in abcd, I'd like it to feed out: ab,ac, ad, bc, bd, cd, ca... etc.

I'll be giving a cash reward for it, $10 minimum, if someone gets it to me pretty quick I can probably give out $20 =)

 

[GtPrOjEcTX]

well, that's an impossible program, since given a X digit long string, there will always be a definate amount of permutations and combinations of it..therefore, not endless

 

[etalns]

Hmm, then you must be misunderstanding what I'm looking for.

If I input a,b,c,d there are only so many combinations which can be given, and it's those combinations which I'd like it to resultingly display.

 

[ArmenK]

i can make a program that does that but it will cost you more than $20 hehe

 

[IcemanJer]

If you look at each individual input as an element in a set, then you're just outputting the power set of the input. That's not a hard program to write at all. Except for the whole running-out-of-stack-space due to a lot of recursion.

 

[GtPrOjEcTX]

well, I retract my previous statement, I had forgot that combinations were involved and if able to repeat digits and have a limitlessly long resulting string, there will be an endless amount of results.

but based on your second post, it sounds just like you want a permutation generator.

 

[IcemanJer]

another issue is, do you consider "ab" and "ba" to be the same result or different? (ie. does order matter?)

 

[ArmenK]

Originally posted by: GtPrOjEcTX
well, I retract my previous statement, I had forgot that combinations were involved and if able to repeat digits and have a limitlessly long resulting string, there will be an endless amount of results.

but based on your second post, it sounds just like you want a permutation generator.

actually its not just permutations, since permutation would use ALL available characters inputted. I think what he wants is all permutations of all subsets of the input.

 

[GtPrOjEcTX]

this what you want?

 

[edmicman]

something like this?

http://users.pandora.be/vdmoortel/dirk/Maths/permutations.html

google has all kinds of stuff like that....looking to cheat at texttwist?

<edit>
lol oops, i'm a little slow....guess that doesn't do the subsets thing either though.....
</edit>

 

[GtPrOjEcTX]

Originally posted by: edmicman
something like this?

http://users.pandora.be/vdmoortel/dirk/Maths/permutations.html

google has all kinds of stuff like that....looking to cheat at texttwist?

<edit>
lol oops, i'm a little slow....guess that doesn't do the subsets thing either though.....
</edit>

:beer:

but yeah, if ArmenK is correct in his assumption that Qosis is wanting subsets of said entered string permuatated, results of abcd would be more like:
a
b
c
d
ab
ac
ad
ba
bc
bd
ca
cb
cd
da
db
dc
abc
abd
acb
acd
..................


Is that what you're wanting it to do Qosis?

 

[etalns]

Originally posted by: GtPrOjEcTX

Originally posted by: edmicman
something like this?

http://users.pandora.be/vdmoortel/dirk/Maths/permutations.html

google has all kinds of stuff like that....looking to cheat at texttwist?

<edit>
lol oops, i'm a little slow....guess that doesn't do the subsets thing either though.....
</edit>

:beer:

but yeah, if ArmenK is correct in his assumption that Qosis is wanting subsets of said entered string permuatated, results of abcd would be more like:
a
b
c
d
ab
ac
ad
ba
bc
bd
ca
cb
cd
da
db
dc
abc
abd
acb
acd
..................


Is that what you're wanting it to do Qosis?

Precisely!

 

[GtPrOjEcTX]

Originally posted by: Qosis
Precisely!

alright. then there is a concrete # then (i.e. not endless) unless you're allowing the digits to be repeated. Is that the case?
EX.
a
aa
aaa
aaaa
....
b
bb
bbb
bbbb
....