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 2014
<<November December January>>
The trivial solution for any number N is [1,1,1,...,1][1,N-1], which gives a 56-bit matrix in our case (N=29). To disallow this solution, we required that the matrix have no more than 50 bits.
The second systematic way is [M-1,1,1,1,...,1][N-1,1,1,1,...,1], which generates 1+(N-1)*(M-1) matrices. This gives solutions like [7,1,1,1,1][4,1,1,1,1,1,1,1].
Gyorgy Gyomai sent us another way to generate a set of numbers: [M-1,2,1][2,2,1,1,1,...,1], which gives 3*k-4 different generating matrices, giving the solution [10,2,1],[2,2,1,1,1,1,1,1,1,1,1].
The smallest solution (24 bits) is [1,2,3,5],[1,1,1,2,3,3].
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com