Thirty friends were on a hiking trip when they decided to enjoy the bonfire. They assembled for it and agreed to play a game. For that, they divided themselves into five teams with seven members each, forming five rows.

How did they manage to achieve this formation?

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?

A man lives on the fifteenth floor of an apartment building. Every morning he takes the elevator down to the lobby and leaves the building. In the evening, he gets into the elevator, and, if there is someone else in the elevator, or if it was raining that day, he goes back to his floor directly. Otherwise, he goes to the tenth floor and walks up five flights of stairs to his apartment. Can you explain why he does this?

One fine day, an intellectual man came to the emperor's court with the aim of testing Birbal's wittiness. In order to do this, he challenged Birbal to answer his question and hence prove that he was as intelligent and witty as he was said to be.
He asked Birbal, Do you want me to ask one difficult question or a hundred easy ones?
Since both Akbar and Birbal had had a tough day and were eager to leave, Birbal hastily told the intellectual to ask him a single difficult question.
Intellectual: OK. Tell me what came first into the world, the egg or the chicken?
Of course, the chicken, Birbal replied with a smile.
This time with a note of victory in his voice, the intellectual asked Birbal, How will you demonstrate that?
What did Birbal say?

I’m orange, I wear a green hat and I sound like a parrot. What am I?

Bopanna was working on a murder case when he received a message about the location of the murder weapon.
The message was encrypted as below.

"deb mitciv eht edisni neddih si nopaew redrum ehT"

Tell me the location of the murder weapon.

Imagine a box with two cogwheels, one big with 24 teeth and one small with 8 teeth. The big one is firmly attached to the center of the box which means it does not turn or move while the small one rotates around the big one.

How many times do you think that the smaller wheel will turn compared to the box when it turns once around the big one?

Can you identify the Oscar-winning movie from the rebus below?

The answer I give is yes, but what I mean is no. What was the question?

If,
29 - 1 = 30
9 - 1 = 10
14 - 1 = 15

Based on similar logic, Can you prove that the below algebraic equation is true?
11 - 1 = 10 ?