Puzzle 202
During the recent BrainBashers cipher convention, a binary code contest took place.
The contest consisted of a binary code transmission where the spaces between the letters were missing and there was no punctuation.
Each letter of the alphabet was translated into its binary equivalent based on its position in the alphabet. The resulting code was then blocked in groups of five digits.
a=1, b=10, c=11, d=100, e=101, f=110, g=111, h=1000, i=1001, j=1010, k=1011, l=1100, m=1101, n=1110, o=1111, p=10000, q=10001, r=10010, s=10011, t=10100, u=10101, v=10110, w=10111, x=11000, y=11001, z=11010
Can you find 10 countries?
10101 10000 11110
10111 11100 10110 011
10000 11111 10011 11010 0
11010 01011 11011 101
11100 01001 11001 01
11011 11110 01011 11111 11111
11010 11101 10100 11
10100 11111 11011 11
10000 11110 11101 1
11011 11111 10111 11111 10010 011
Puzzle 203
Each empty white square in the grid contains one of the numbers 1, 2, 3, …, 8. Each of the horizontal and vertical equations must be true, and each number must be used exactly once.
Puzzle Copyright © Erich Friedman
Puzzle 204
Can you make this equation correct by moving exactly one matchstick?
Note: this puzzle is not interactive, and the matchsticks cannot be moved. The matchstick layouts for each digit are:
