This is somewhat a continuation of my random post about finding all possible combinations of 2 digit numbers.

I wasn't very clear what I was trying to accomplish but in the end I got the info I sought(even though I mistook it for something more complicated which it certainly would be if there were more digits to consider/letters thrown in the mix).

 

Anyways continuing off of that I have determined that the numbers I am working with there are 999 sets of numbers I must deal with. Sadly when you take into consideration the 99 possible sets of 2 digit numbers that means there are 99 possible sets for each of the 999 sequences of numbers.

 

Although it's simple in essence the problem is the time consuming nature of the task of listing all 99 possible sequences for each one of the 999 larger sequences.

 

If there's a program that could make easy work of this please let me know(I was thinking excel but I am not sure if this is possible under that).

 

the goal is to list all 99 possible sequences for each of the following 999 sets of numbers. the 99 possible 2 digit numbers must be placed before the 61 at the end of each of the 999 three digit numbers.

 

set one is 100- **61 and the final set is 999-**61

The ** resemble where all possible 2 digit numbers ranging from 00-99 should go.

 

so for example set 100-**61 will need to cover all possible combinations starting from 100-0061 all the way too 100-9961 and so on and so forth until you get to 999-9961

 

I hope that makes sense.

 

No I don't expect anyone to be able to list all 98,901 combinations I just need some advice of how I am going to assemble this information in a reasonable time(Ideally 100% automated like a calculator of sorts).

 

Thanks in advance

I think I've created it however you will have to find a way to add the -'s.

 

http://www.fileconvoy.com/dfl.php?id=g754633e25387871e9997329009d3baa73678985e2

I think I've created it however you will have to find a way to add the -'s.

 

http://www.fileconvoy.com/dfl.php?id=g754633e25387871e9997329009d3baa73678985e2

What do mean by add the -'s?

why such long threads in spam section

100-0061 is the first combination (000-0061 doesn't count?)

Then 100-0061 to 100-9961 which changes to 101-0061 -> 101-9961 all the way up to 999-0061->999-9961?

 

So YXX-XX61? With Y all numbers except 0, and X all numbers 0-9. That would make 9*10*10*10*10=90.000 combinations?

What do mean by add the -'s?

 

 

My list is compiled as 

1000061

1000161

1000261

....

.....

9999961

 

100-0061 is the first combination (000-0061 doesn't count?)

Then 100-0061 to 100-9961 which changes to 101-0061 -> 101-9961 all the way up to 999-0061->999-9961?

 

So YXX-XX61? With Y all numbers except 0, and X all numbers 0-9. That would make 9*10*10*10*10=90.000 combinations?

 

 

 

 

Believe so I got the same number but I just did 99,999 - 9,999 as the list I created is just numbers generated from 10,000-99,999 with a suffix of 61 lol

Edited October 9, 201510 yr by brandonmw420

why such long threads in spam section

Sorry about that.

 

Wasn't sure where else I could ask this.

This is extremely important for me to figure out and I obviously can't do this entirely by hand.

Sorry about that.

 

Wasn't sure where else I could ask this.

This is extremely important for me to figure out and I obviously can't do this entirely by hand.

 

 

If someone with coding knowledge can figure out a way to make this work except insert after the 3rd char of each line instead of at the beginning of each line then you'd have your list using the attachment I put above. 

http://linuxconfig.org/add-character-to-the-beginning-of-each-line-using-sed

 

Alternatively (a bit time consuming and can't be the best way by any means.) You could open the list I created and create a macro to manually add the -'s and run it for 90,000 cycles lmao

Edited October 9, 201510 yr by brandonmw420

 

This is somewhat a continuation of my random post about finding all possible combinations of 2 digit numbers.

I wasn't very clear what I was trying to accomplish but in the end I got the info I sought(even though I mistook it for something more complicated which it certainly would be if there were more digits to consider/letters thrown in the mix).

 

Anyways continuing off of that I have determined that the numbers I am working with there are 999 sets of numbers I must deal with. Sadly when you take into consideration the 99 possible sets of 2 digit numbers that means there are 99 possible sets for each of the 999 sequences of numbers.

 

Although it's simple in essence the problem is the time consuming nature of the task of listing all 99 possible sequences for each one of the 999 larger sequences.

 

If there's a program that could make easy work of this please let me know(I was thinking excel but I am not sure if this is possible under that).

 

the goal is to list all 99 possible sequences for each of the following 999 sets of numbers. the 99 possible 2 digit numbers must be placed before the 61 at the end of each of the 999 three digit numbers.

 

set one is 100- **61 and the final set is 999-**61

The ** resemble where all possible 2 digit numbers ranging from 00-99 should go.

 

so for example set 100-**61 will need to cover all possible combinations starting from 100-0061 all the way too 100-9961 and so on and so forth until you get to 999-9961

 

I hope that makes sense.

 

No I don't expect anyone to be able to list all 98,901 combinations I just need some advice of how I am going to assemble this information in a reasonable time(Ideally 100% automated like a calculator of sorts).

 

Thanks in advance

 

 

if you add me on skype i will make a small program that does this for you.

 

This is somewhat a continuation of my random post about finding all possible combinations of 2 digit numbers.

I wasn't very clear what I was trying to accomplish but in the end I got the info I sought(even though I mistook it for something more complicated which it certainly would be if there were more digits to consider/letters thrown in the mix).

 

Anyways continuing off of that I have determined that the numbers I am working with there are 999 sets of numbers I must deal with. Sadly when you take into consideration the 99 possible sets of 2 digit numbers that means there are 99 possible sets for each of the 999 sequences of numbers.

 

Although it's simple in essence the problem is the time consuming nature of the task of listing all 99 possible sequences for each one of the 999 larger sequences.

 

If there's a program that could make easy work of this please let me know(I was thinking excel but I am not sure if this is possible under that).

 

the goal is to list all 99 possible sequences for each of the following 999 sets of numbers. the 99 possible 2 digit numbers must be placed before the 61 at the end of each of the 999 three digit numbers.

 

set one is 100- **61 and the final set is 999-**61

The ** resemble where all possible 2 digit numbers ranging from 00-99 should go.

 

so for example set 100-**61 will need to cover all possible combinations starting from 100-0061 all the way too 100-9961 and so on and so forth until you get to 999-9961

 

I hope that makes sense.

 

No I don't expect anyone to be able to list all 98,901 combinations I just need some advice of how I am going to assemble this information in a reasonable time(Ideally 100% automated like a calculator of sorts).

 

Thanks in advance

 

 

 

if you add me on skype i will make a small program that does this for you.

 

Already done :P

 

http://s000.tinyupload.com/index.php?file_id=08839699258513660012

if you add me on skype i will make a small program that does this for you.

Wow thank you!

Mine is spikeyhairedweasel

7

Alright I got what I wanted.

Sorry for the obscure post going to lock this now.