Puzzle 17
At the local play group for babies and toddlers, I was asking about the number of teddies each of child had.
The four children are aged 1, 2, 3 and 4.
Remarkably, the children have one, two, three and four teddies, although not necessarily respectively.
Dale has more teddies that their age. Jesse is older than Morgan. Curiously only one child has the same number of teddies as their age. Pat has fewer teddies than Jesse and the child aged 3 has two teddies. Pat is the youngest.
Can you determine who has which teddies?
Puzzle 18
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 19
Art Theftall logic puzzles
After a local art theft, six suspects were interviewed.
Below is a summary of their statements.
Police knew that exactly four of them told one lie each, and all the other statements were true.
From this information, can you tell who committed the crime?
Alex said:
It wasn't Billie
It wasn't Drew
It wasn't Emery
Billie said:
It wasn't Alex
It wasn't Chris
It wasn't Emery
Chris said:
It wasn't Billie
It wasn't Frankie
It wasn't Emery
Drew said:
It wasn't Alex
It wasn't Frankie
It wasn't Chris
Emery said:
It wasn't Chris
It wasn't Drew
It wasn't Frankie
Frankie said:
It wasn't Chris
It wasn't Drew
It wasn't Alex
Puzzle 20
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.
Can you find 10 girl's names?
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
11001 11000 11001 01110 01
10001 11101 11011 000
11001 10101 10010 10111 10
11101 00111 11111 10010 1
11101 11110 1001
10010 11110 00101 1100
10101 11110 01010 01111 0
11010 11001 00101 01110 01
10011 11110 10010 0101
10010 11110 10011 00111 01