Puzzle 1
Are there more …
… 2's or 8's in the numbers from 1 to 50,000?
workings
hint
answer
print
www.brainbashers.com
/puzzle/zcmx
share
Hint
Think about the first digits of the numbers.
Answer
There are more 2's because of the numbers beginning with 20,000.
Puzzle 2
Using the new BrainBashers programming language, BrainBasic, the following words have their equivalents next to them, what should FOX be?
CLICK = 100501100K
MILK = 1000150K
LOG = 50OG
LIFE = 501FE
ALIVE = A5015E
FOX = ?
Puzzle Copyright © Kevin Stone
workings
hint
answer
print
www.brainbashers.com
/puzzle/zwtb
share
Hint
In the word LOG, why might the L have be replaced with 50?
Answer
FO10.
Reasoning
If there is a Roman numeral, it is replaced by its modern equivalent.
I = 1
V = 5
X = 10
L = 50
C = 100
D = 500
M = 1000
Double-Checking
CLICK = 100 50 1 100 K
MILK = 1000 1 50 K
LOG = 50 O G
LIFE = 50 1 F E
ALIVE = A 50 1 5 E
FOX = F O 10
Puzzle 3
Starting with any C, using the move of a chess knight, can you find the letters of Christmas in the correct order?
The moves of a knight are:
Puzzle Copyright © Kevin Stone
workings
hint
answer
print
www.brainbashers.com
/puzzle/zank
share
Hint
A knight moves in the shape of an L, two squares one way, one square the other.
Answer
Puzzle 4
The river Pregel ran through the town of Konigsberg. In the river were two islands, connected to each other and the rest of the city by seven bridges.
The residents of Konigsberg challenged each other to walk through the city, and cross each of the seven bridges exactly once.
Can you find a path that they might have taken?
This is the 'Seven Bridges of Konigsberg' puzzle, tackled by Leonhard Euler in 1736.
workings
hint
answer
print
www.brainbashers.com
/puzzle/ztny
share
Hint
Try starting in one corner.
Answer
There is no possible route.
Leonhard Euler (1707 to 1783), a Swiss polymath, was the first to prove that this puzzle had no solution.
next >