Find the Ages

Jenifer and Jesica are having a conversation.

Jenifer: I am definitely not over 30.
Jesica: I am 28 and you are surely 5 years older to me at least.
Jenifer: No, you are at least 29.

You are told that both of them are lying throughout in the conversation. Can you find their respective ages?




Similar Riddles

John is pretty weird. He likes toffees but hates chocolates. He loves books but never reads. He likes to build his troops in an online game but does not proceed with the war. He likes to go swimming but is afraid of water.

Seeking this behaviour, can you tell whether he likes balloons and parties?

Asked by Neha on 05 May 2024


Dr Doom invited a group of puzzle fanatics to a party which was oriented toward having puzzle-oriented games. At night, he introduced the guests to a 'unique riddle'. A prize was offered to the one who solved it first.

The guests included six people named Tom Paul, Fox Obama, Jeremy Reener, Alex Murphy, Prim Pastor, and Ellen Page. The winner of the 'unique riddle' contest was to be announced after the dinner. So Dr. Doom stood up and started the announcement:

'Okay now everybody!'
'The winner of�'
'The Hardest Riddle Ever Event'

But before he could complete it, the light went out and his voice was not heard without the mic by anyone. But they already knew who the winner was. Can you deduce the name of the winner?

Asked by Neha on 11 May 2026

John needs to purchase 100 chocolates from three different shops and he has exactly 100 rupees to do that which he must spend entirely. He must buy at least 1 Chocolate from each shop.

The first shop is selling each chocolate at 5 paise, the second is selling at 1 rupee and the third is selling at 5 rupees.

How many chocolates should he buy from each shop?

Asked by Neha on 23 Aug 2023


A brand new Mobile Phone was on sale at 20% as a promotional offer. By what per cent must the Mobile price be increased to sell it at the original price again?

Asked by Neha on 26 Oct 2023

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?

Nodes Connectivity Riddle

Asked by Neha on 20 Dec 2020

A Doctor always sneezes before the rain. Doctor sneezes, Will it rain?

Asked by Neha on 24 Jul 2024


You can see it everyday, But cannot touch it at will. What is it?

Asked by Neha on 17 May 2021

A small town is visited by an ice-cream truck every day. On the first day of February, the truck visits as usual and 5 children, one from each of the first 5 houses on the street buys an ice cream that is of the different flavor from each other along with a completely different topping.

Go through the details below and find out which child lives in which house and bought which ice-cream flavor with which topping:

1. Jim lives between the child who bought the Raspberry topping and the child who bought mango ice cream.

2. Joyce, whose house has an even number, bought the cherry topping. Nancy does not live next to Joyce.

3. The blackcurrant ice cream had no topping.

4. The child who lives in house number 2 had the butterscotch ice cream. The child in house number 3 did not have chocolate ice cream.

5. Mike had banana ice cream. He hates banana cherry.

6. The child who had the cashew topping lives in house number 5. Dustin does not live in house number 4.

Please note that the odd numbered houses and the even numbered houses are located on the exactly opposite sides of the street.

Asked by Neha on 27 Jul 2021

There are 2 people near the river and both of them want to get on the other side. The boat can only take one of them. But they got across.
How?

Asked by Neha on 03 May 2021


What goes up but never comes down?

Asked by Neha on 26 Oct 2021

Hot Articles

Amazing Facts

Artificial Intelligence

Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.