Bonus question: If we would have asked a similar question for sequences of 14 bits, what would be the connection of the result to IBM?

Hint: We asked a similar bonus question in the past, and the number of solvers was then a multiplication of two prime numbers.

Update (8/2):A. The "for b in v" part means that for every binary sequence v of length 42, perform the next three lines 42 times when the binary variable b goes over all the bits of v.
B. Note that to bet the bonus '*' you need to solve *a similar* problem...

We will post the names of those who submit a correct, original solution! If you don't want your name posted then please include such a statement in your submission!

We invite visitors to our website to submit an elegant solution. Send your submission to the ponder@il.ibm.com.

If you have any problems you think we might enjoy, please send them in. All replies should be sent to:ponder@il.ibm.com