Have you mastered the art of solving puzzles and brain teasers already? Well, we have the following section of Hard Puzzles and Riddles especially for you. See for yourself how good you are at solving the hardest of them. If you can solve the following Hard Puzzles and Riddles, consider yourself to be a master at it.
6 + 6 + 6 = N (last letter of sum i.e. eighteen)
7 + 7 + 7 = E (last letter of sum i.e twentyone)
8 + 8 + 8 = R(last letter of sum i.e twentyfour)
0 + 0 + 0 = O (last letter of sum i.e. zero)
In a game of tennis, On 1st set, Federer beat Nadal at a scoreline of 6:3.
There are total of five service break in the game
Who served first Nadal or Federer.
Note: Service Break means the player who serves the game lost the game.
The one who serves first can serve 5 and other will serve four.
== Option A ==
If Federer serve 4 and Nadal serve 5
Then five service breaks and Federer winning 6:3 not possible.
== Option B ==
Federer serve 5 and Nadal serve 4
There are five service breaks and score is Federer 6 - Nadal 3
On Federer serve, Federer wins 3 and lost 2
On Nadal serve, Federer wins 3 and lost 1
Flik a famous ant is traveling on a 1000 cm long rope. Flik is traveling at 1cm/seconds, but also entire rope is being stretched by an extra 1000cm/second.
Will the Flik every reach the end of the 1000cm long rope?
Assume that the rope can be stretched forever. Assume the rope is evenly stretched. The moving speed of the end point of the rope (relative to the starting point) is 1000 cm/second.
Each second the ant moves 1cm, at the same time that 1cm rope stretches to be 1000+1000t1000+1000(t−1)= t+1tcm where t is the number of seconds after the ant is on the rope. Therefore, the ant has a moving speed of t+1t cm/second.
Therefore, the moving speed of the ant is far less than the moving speed of the end point of the rope.
Filk will never reach the end of the 1000 cm long rope.
Can you write a sentence that satisfies following three properties
1. It's a palindrome
2. The statement is true.
3. It Can be used as a template to generate an infinite number of sentences which are both palindromes and true.
The black king is placed as shown in the picture below. You are playing as white and given four rooks. You need to place one Rook at a time and ensure the black king will always be in check state. After four moves you need to guarantee the checkmate position.
How will you do this?