Movie with Friends

If you go to the movies and you're paying, is it cheaper to take one friend to the movies twice, or two friends to the movies at the same time?




Similar Riddles

Find the next number in the series below

21 32 54 87 131 ?

Asked by Neha on 16 Nov 2023


Can you name four days which start with the letter 'T'?

Asked by Neha on 20 Nov 2024

Six people park their car in an underground parking of a store. The store has six floors in all. Each one of them goes to a different floor. Simon stays in the lift for the longest. Sia gets out before Peter but after Tracy. The first one to get out is Harold. Debra leaves after Tracy who gets out on the third floor.

Can you find out who leaves the lift on which floor?

Asked by Neha on 24 Dec 2024


An inspection by the superintendent of St. Joseph School was scheduled on the next day. The class teacher Jenifer knew that he would be asking questions from her class and she would have to choose a pupil to answer. To offer a perfect impression over him, the teacher explained certain instructions to the students to maximise the chances of getting correct answer every time.

What did she say to the students?

Asked by Neha on 14 Jul 2021

As shown in the image, the nine Dogs are square fenced. By constructing just two square fences can you make sure that two Dogs cannot meet each other without crossing the fence?

Fence the Fencing

Asked by Neha on 09 Mar 2021

Two men play a dice game involving roll of two standard dice. Man X says that a 12 will be rolled first. Man Y says that two consecutive 7s will be rolled first. The men keep rolling until one of them wins.

What is the probability that X will win ?

Asked by Neha on 13 Apr 2023


A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?

Castles in a line

Asked by Neha on 18 Sep 2023

You are trapped in a room with two doors. One leads to certain death and the other leads to freedom. You don't know which is which.
There are two robots guarding the doors. They will let you choose one door but upon doing so you must go through it.
You can, however, ask one robot one question. The problem is one robot always tells the truth, the other always lies and you don't know which is which.
What is the question you ask?

Asked by Neha on 08 May 2026

Detective John was investigating a murder in China.
It was a difficult case, and John was completely stumped until he noticed a message sent to him by the killer cunningly hidden in a newspaper advertisement selling Car Licence Plates.
Detective John thought about it for a while, and when he had solved the puzzle, immediately arrested the guilty man.

Q1) How did John know the advert was a clue for him?

Q2) Solve the code and tell me who John arrested.

This is the newspaper advert (Car licence plates for sale) that Detective John saw.

Plates For Sale;

[W 05 NWO]
[H 13 HSR]
[O 05 EBM]
[D 08 UNE]
[U 10 HTY]
[N 04 BRE]
[N 16 TTE]
[I 26 LHC]
[T 10 AEE]
[I 26 CNA]
[X 22 VDA]

Asked by Neha on 07 Jul 2023


Trying to tease Birbal, Akbar gave him one gold coin and ask him to buy
* something for him to eat
* something for him to drink.
* something to feed the cows
* something to plant in the garden
and most important you need to buy only one thing.

What must Birbal buy to silence Akbar?

Asked by Neha on 10 May 2021

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