s c lottery numbers
s c lottery numbers
Lottery Ticket Math Puzzle?
I found this puzzle where you have to figure a set of winning lottery numbers that satisfy certain conditions. Here they are:
Nobwick’s Clue: Let the winning numbers be A, B, C, D, E, F, G such that 1 <= A < B < C < D < E < F < G <= 49
Loopwinkle's Clue: Let P = A * B * C * D * E * F * G
Bunknor's Clue: Let S = A + B + C + D + E + F + G
Ruggles' Clue: Let X be the number of combinations that yield S. In other words, of all possible A, B, C, D, E, F, G, let X be the number of combinations where A + B + C + D + E + F + G equals the sum of the winning numbers.
Murpen's Clue: This condition is satisfied by the winning numbers: P = S * X
Pilbert's Clue: P of the winning numbers satisfies this condition: 125,000,000 < P < 175,000,000
Does anyone know how to solve it?
Well, you could write a program that generates all the combinations and checks the conditions that this puzzle requires. Maybe there’re other ways that I don’t know. But this in particular case this is what it comes to my mind.
BTW – where did you find this puzzle?
You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.
