Privacy Policy

Terms & Conditions

See Details This website uses cookies. By using this website you are accepting the use of cookies. For more information please view our privacy policy.
The river Pregel runs through the town of Konigsburg. In the river are two islands, connected to each other and the rest of the city by seven bridges.
The students of Konigsburg often challenge each other to try to make a trip crossing all seven bridges exactly once  can you find the path they have to take in order to do this?
[Ref: ZTNY]
Hint: Try starting in one corner.
Answer: There is no such route.
This is a very famous mathematical problem which was first posed by Euler (pronounced 'oiler').
It was a founding problem in graph theory, an area of mathematics which is very important in modern times, and is used in everything from cryptography to route optimisations.
Puzzle 62
Below, 10 nine letter words have been broken into chunks of three letters.
These chunks have been mixed up, no chunk is used twice and all chunks are used.
Can you determine what the 10 words are?
cer ent ead rat uti spr
ful oun pro ann ope ock
nce een oat est liv ion
nou sev ion ast hou akf
bre bea ens dim bed seb
Hint: These are the first letters of the words: P, B, D, L, O, A, B, H, S, B.
Answer:
pro + nou + nce = pronounce
bea + uti + ful = beautiful
dim + ens + ion = dimension
liv + est + ock = livestock
ope + rat + ion = operation
ann + oun + cer = announcer
bed + spr + ead = bedspread
hou + seb + oat = houseboat
sev + ent + een = seventeen
bre + akf + ast = breakfast
Puzzle 63
Last weekend I was given my pocket money, which is meant to last me all week.
On Monday, I spent a quarter of my money on clothes.
On Tuesday, I spent one third of my remaining money on a CD.
On Wednesday I spent half of my remaining money on sweets.
Finally on Thursday I spent my last £1.25 on a comic.
Answer:
These are the numbers 1, 2, 3, etc, as seen on a calculator, but the digits are then cut in half and the left half is then mirrored.
BrainBashers™ is a trademark. This website uses cookies. By using this website you are accepting the use of cookies. For more information please view our privacy policy. By using this website you are also agreeing to our terms and conditions.