# Lottery Combo Question

Does any one know an equation to solve what the combo is for like any number set, for a lotto system with 47 balls?  For Example 1 2 3 4 5 = 1 combo, the number set 1 2 3 4 6 = 2 combo, 1 2 3 4 7 = 3 combo... 43 44 45 46 47 = 1,533,939.  I know to figure out the combos for all the number for this is take (43*44*45*46*47)/5! = 1533939.  Any help would be appreciated :)

Chet

At www.saliu.com/infodown.html there is a program NthIndex.EXE. that find the index of a lotto combination and vice-versa.  For example the combination 5 10 15 20 25 is index no. 611,893 in those 1533939 combinations.

Hope this is what you're looking for. Good luck to you.

RJOh

Yeah the program works, but i am trying to find an equation that does pretty much one thing.  The code this program loops through the combos one by one keeping a counter.  I know how to do that.  What i am trying to do is write some code that runs through all the numbers drawn so far in the lottery compute the corresponding combo #, and if it loops though a lot of combos trying to find it, that is a lot of wasted cpu time, and could take awhile to get all the combos for all that was drawn thus far.  Well i guess could loop through each combo and while it is on that combo check it against all numbers, then go on to the next combo and do the same ect. till all the drawn combo have been check, that would save a lot of cpu time.  Well if anyone runs across the equation it would be much help :)

Chet

here is some pseudo code

for loop int a = 0; a < 42; a++

first slot[0] = a;

for loop int b = a +1; b < 43; b++

second slot[1] = b;

for loop c = b + 1; c < 44; c++

third slot[2] = c;

and so forth to "e < 45". int Slot[] can be pushed on a array[] and then the the comparison in some more loops with your drawn numbers. It is difficult if you don't have some programming experience, but not to hard if you have some.

It isn't much CPU time 30 sec. to 1.5 mins tops. Use the index of array[] as your guide to the combo number, Good Luck.

edit "e < 47"

Quote:Originally posted by RJOh on September 25, 2003

At www.saliu.com/infodown.html there is a program NthIndex.EXE. that find the index of a lotto combination and vice-versa.  For example the combination 5 10 15 20 25 is index no. 611,893 in those 1533939 combinations.

Hope this is what you're looking for. Good luck to you.

RJOh

Simple is not easy for you all to comprehend!  Their will

NEVER be time for all those combinations to fall or even part or as

you or anyone would believe!  Sums set limits in most time in just

a few years never going any higher or lower after that!

Sequencial order also sets the direction of numbers that have to

do with anything anyone should be able to see that if that option

was or is avaible to them!  A group proved that years ago when

they won with out playing all the combos!  Since most sums that

come are in the middle say 5 digit 15 to 185 say 85 +- what

about 6 digit 24 to 279 sum?

Chet

What are you going to do use all the wood in Muier Nat Park!

If you had a program for reapeatting sets you would have many 5 out 6 groups but not a winner!  To many combos & 6 digits will never reapeate in the end!

Quote:Originally posted by Cheters on September 26, 2003

Chet

I guess if you index them as you say you numbered them from #! to #435,000 right!

Then highlight the ones that came in after you find the low/high sums to help you determine the numbers you want to play don't for get reapeading sets!

E-mailed my dos program!

Good luck worked on this for a while w/BRAD!

The loop numbers should start a = 1; a < 44; then b = a +1; b < 45. and so on. This gets you a list without duplicates. Sorry it was early when I first posted.

Remember to stick below code in all but the last "for" loops

if != slot[] to result[]

continue;

in your loops. This will insure that you omit many useless comparisons by incrementing the current slot before comparing the second, third, etc., slot. I may be explaining the obvious, but I am not sure. I think that this would cut each result comparison down to a maximum of 43 + 44 + 45 +46 + 47 or 225, instead of all multiples combos.

Quote:Originally posted by Bug on September 26, 2003

Remember to stick below code in all but the last "for" loops

if != slot[] to result[]

continue;

in your loops. This will insure that you omit many useless comparisons by incrementing the current slot before comparing the second, third, etc., slot. I may be explaining the obvious, but I am not sure. I think that this would cut each result comparison down to a maximum of 43 + 44 + 45 +46 + 47 or 225, instead of all multiples combos.

A simple repeating sets would help your problem, it would show how many times numbers had repeated!  Start w/3 then 4 then then 5 mostly 6 will never!

You would not write the code like that if you wanted to include duplicates! The abstraction though seems to be to difficult for you to understand. Repeating sets puts you around 7 million numbers. Your solution for what is your problem, and not Chets if I understand him correctly, is amateurish.

the problem with sums are that they are too generic... not easy to decode a sum into a set of 5 or 6 numbers...

and while most lottery databases only provide draw history in sequential order, draw history is more accurate because a sorted number could have been drawn several different ways. sorting is a process added AFTER the drawing and it should be remembered that it was done to make the numbers easier to read, it's not a true indication of what happened during the draw...

1-22-40-48-49  sorted order, could have been drawn as

1-22-40-48-49
22-49-1-48-40
48-40-49-1-22
49-40-1-48-22

etc... sequential data is easier to analyze, but leads to very subjective results.

for example... most frequently drawn number (by position)

sorted order (powerball 5 white balls) 02--17--27--42--52

drawn order (powerball 5 white balls) 09--14--06--46--26

powerball is just one ,in either case most frequent (statistical MODE) is 20

sorted order imparts a "weight" to the number on the ball, which honestly does not exst other than to identify the ball... position at start (before they are dropped into the bin) is much more accurate... if a 10 is drawn more than a 22, it has nothing to do with the value of the number painted on the ball, rather... the starting position may make the 10's appearance more favorable.

any stats gleaned from sorting are subjective, you could spin them any way you want... sums, high/low, odd/even...

here's another example... positional number boundaries... (powerball)

Sort order
First ball  1 to 32
2nd ball    2 to 45
3rd ball    6 to 50
4th ball    9 to 51
5th ball    10 to 53

Draw order
First ball  1 to 53
2nd ball    1 to 53
3rd ball      1 to 52
4th ball      2 to 53
5th ball      1 to 52

in both cases, Powerball is 1 to 42.. all based on the 101 drawings since 5/53 + 1/42.

true, sorted order makes it easier to spot trends, but it also makes it easier to spot false trends

Quote:Originally posted by Bug on September 26, 2003

You would not write the code like that if you wanted to include duplicates! The abstraction though seems to be to difficult for you to understand. Repeating sets putsyou around 7 million numbers. Your solution for what is your problem, and not Chets if I understand him correctly, is amateurish.

It seems to me that anyone who would look at this in a normal matter and they doe not need to be a rocket scientist!  Why would you look at numbers, groups, drawing that have never come in?

This should apply to the numbers that have been drawn!  The lottery game6/49 won't be here that long!  In Ohio 6/47 6/40 & 6/53 have gone! now 6/49 is running since 1991 thats 12 years + the sums are set 53/236?

And the most draws start w/1

with 1 thru 10 with the most 75% +- 11 thru 3?m or 4? 25 %

odds more than even because there are more odds!

You could run all lotteries together and little would change except the numbers used!

 Pi=3.14!

Pi

«py», is the ratio of the circumference of a circle to its diameter. This ratio is the same for every circle and is approximately 3.14159.

Pi is used in a number of mathematical calculations. For example, the circumference (c) of a circle can be determined by multiplying the diameter (d) of the circle by pi: c = pi X d. Pi is also used to calculate the areas of circles and the volumes of spheres and cones. The area (A) of a circle is given by the formula A = pi X r-squared, where r is the radius. In addition, a number of formulas that describe such physical phenomena as the motion of a pendulum or the vibration of a string include pi as well.

Pi is an irrational number. An irrational number cannot be written as a simple fraction or as a decimal with a finite (limited) number of decimal places.Mathematicians have used computers to calculate pi to more than 1 trillion decimal places.

It has not stoped anyone yet!

Good luck!

ALL THE NUMBERS add up to 160!

No matter how they came out!

Now what?  Should we video all draws to see how they were drawn?  The numbers are on two sides equal in size & shape and weight the same in grams! +-!

Welcome Guest

Your last visit: Sat, Jul 31, 2021, 7:51 pm