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?
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.
John Went to the nearby store in a Mall to buy something for her home. Below is the conversation between the two:
John: How much for the one?
Shopkeeper: It is $2
John: How much for the Eleven?
Shopkeeper: It is $4
John: How much for the Hundred?
Shopkeeper: It is $6.
A frog is at the bottom of a 30-meter well. Each day he summons enough energy for one 3-meter leap up the well. Exhausted, he then hangs there for the rest of the day. At night, while he is asleep, he slips 2 meters backwards. How many days does it take him to escape from the well?
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.
Using four sevens (7) and a one (1) create the number 100. Except for the five numerals, you can use the usual mathematical operations (+, -, x, :), root and brackets ()