# Riddle Me This: 5 HARD Riddles!

• 6,459 views, 0 today
• 4
• 2
• 1
KAP40
Level 45 : Master Necromancer
164
Hello everyone! Today, I watched The Hobbit: An Unexpected Journey and loved the scene with Gollum/Smeagol and Bilbo when they had a riddle competition. There were some pretty tough ones, so I decided to find some riddles and post them here! Here's the rules of this comeptition:
1. No posting answers in Comment section.
2. Don't cheat or look up answers.
5. HAVE FUN & DON'T GIVE UP!

Here we go!

Riddle #1: A man hijacks an aeroplane transporting both passengers(8 of them) and valuable cargo. After taking the cargo, the man demands nine parachutes, puts one of them on, and jumps, leaving the other eight behind. Why did he want eight?

Riddle #2: What are the next three numbers in this series?4, 6, 12, 18, 30, 42, 60, 72, 102, 108, ?, ?, ?

Riddle #3: You are given 2 eggs.-> You have access to a 100-story building.
-> Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100th floor.Both eggs are identical.
-> You need to figure out the highest floor of a 100-story building an egg can be dropped without breaking.
-> Now the question is how many drops you need to make. You are allowed to break 2 eggs in the process

Riddle #4:On Bagshot Island, there is an airport. The airport is the homebase of an unlimited number of identical airplanes. Each airplane has a fuel capacity to allow it to fly exactly 1/2 way around the world, along a great circle. The planes have the ability to refuel in flight without loss of speed or spillage of fuel. Though the fuel is unlimited, the island is the only source of fuel.What is the fewest number of aircraft necessary to get one plane all the way around the world assuming that all of the aircraft must return safely to the airport? How did you get to your answer?
Hints:
(a) Each airplane must depart and return to the same airport, and that is the only airport they can land and refuel on ground.
(c) The time and fuel consumption of refueling can be ignored. (so we can also assume that one airplane can refuel more than one airplanes in air at the same time.)
(d) The amount of fuel airplanes carrying can be zero as long as the other airplane is refueling these airplanes. What is the fewest number of airplanes and number of tanks of fuel needed to accomplish this work? (we only need airplane to go around the world)

Riddle #5: The Puzzle: Here is a famous prize problem that Sam Loyd issued in 1882, offering \$1000 as a prize for the best answer showing how to arrange the seven figures and the eight 'dots' .4.5.6.7.8.9.0. which would add up to 82?