About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
December 2009
<<November December January>>
The product is even, so it must be a power of 2, which means that every one of the 10 terms has only one bit set. The condition actually implies that x encodes a permutation on 5 elements. N=7 questions are needed and, for example, the N-2=5 mask questions {0x83, 0x700, 0x41800, 0x288000, 0xc00010} divide the 120 possibilities into subsets of no more than 4 elements. It is easy to show that 2 more questions suffice.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com