Hard Aptitude Number

Can you solve this amazing hard number series problem?
7, 8, 10, 12, 16, 18 ?




Similar Riddles

John, Jack and Jill are in a desert. John doesn't like Jill and hence decides to murder him. He poisons the water supply of Jill. Since it is a desert area, Jill must drink or he will die of thirst.

Jack does not know of the actions of John and also decides to murder Jill. To succeed in his ill motives, he removes the water supply of Jill so he dies of thirst.

Jill dies due to thirst. Who murdered Jill?

Asked by Neha on 08 Aug 2023


A doctor and a boy were fishing. The boy was the doctor’s son, but the doctor was not the boy’s father. Who was the doctor?

Asked by Neha on 04 Mar 2022

Two guards were guarding the camp.Guard-1 was looking towards the south to make sure no threat is coming from the road.Guard-2 was looking at the north to make sure no threat is coming from the top. Suddenly Guard-1 ask the Guard-2 why he is smiling?How Guard-1 knows that Guard-2 is smiling?

Asked by Neha on 30 May 2023


Two fathers and two sons decided to go to a shop and buy some sweets upon reaching. Each of them bought 1 kg of sweet. All of them returned home after some time and found out that they had 3kg of sweets with them.

They did not eat the sweets in the way, nor threw or lose anything. Then, how can this be possible?

Asked by Neha on 01 Jun 2024

I have holes on the top and bottom. I have holes on my left and on my right. And I have holes in the middle, yet I still hold water. What am I?

Asked by Neha on 17 May 2021

I look flat, but I am deep. Hidden realms I shelter. Lives I take, but the food I offer. At times I am beautiful. I can be calm, angry, and turbulent. I have no heart but offer pleasure as well as death. No man can own me, yet I encompass what all men must have. What am I?

Asked by Neha on 01 Jun 2025


Can you find the hidden animal in the picture below?

Find Animal In Picture Riddle

Asked by Neha on 14 Apr 2021

The warden meets with 23 new prisoners when they arrive. He tells them, "You may meet today and plan a strategy. But after today, you will be in isolated cells and will have no communication with one another.

"In the prison is a switch room, which contains two light switches labeled 1 and 2, each of which can be in either up or the down position. I am not telling you their present positions. The switches are not connected to anything.

"After today, from time to time whenever I feel so inclined, I will select one prisoner at random and escort him to the switch room. This prisoner will select one of the two switches and reverse its position. He must flip one switch when he visits the switch room, and may only flip one of the switches. Then he'll be led back to his cell.

"No one else will be allowed to alter the switches until I lead the next prisoner into the switch room. I'm going to choose prisoners at random. I may choose the same guy three times in a row, or I may jump around and come back. I will not touch the switches, if I wanted you dead you would already be dead.

"Given enough time, everyone will eventually visit the switch room the same number of times as everyone else. At any time, anyone may declare to me, 'We have all visited the switch room.'

"If it is true, then you will all be set free. If it is false, and somebody has not yet visited the switch room, you will all die horribly. You will be carefully monitored, and any attempt to break any of these rules will result in instant death to all of you"

What is the strategy they come up with so that they can be free?

Asked by Neha on 10 May 2021

The following alphametic has only one solution. Can you find it?
ENLIST + SILENT + LISTEN = ANAGRAM

PS: You may start the number from 0.

Asked by Neha on 12 Jun 2023


How many bananas can you eat if your stomach is empty?

Asked by Neha on 13 Mar 2022

Hot Articles

Amazing Facts

No Solution

In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki