Using mathematical symbols like +, -, and x in order to make the equations correct. Replace # with the above-given symbols.

9 # 8 # 7 # 6 # 5 # 4 = 91

_ _ _ IE _ _
_ _ _ IE _
_ _ IE _ _
_ _ IE _
_ _ _ _ IE

Like you see, some letters have gone missing from these words that contain the IE pair at some or the other place. The letters that will be used to fill the blanks are given below. Use them and form meaningful words. Can you do that?

A, C, D, F, H, K, L, M, N, N, O, R, R, S, S, S, T, T, Y and Y.

What is the largest amount of money that you can possess in change and still if someone asks you for a dollar, you won't be able to give?

What does below pictogram mean?

John has eleven friends. He has a bowl containing eleven apples. Now He wants to divide the eleven apples among his friends, in such a way that an apple should remain in his bowl.
How can He do it?

This is a most unusual paragraph. How quickly can you find out what is so unusual about it? It looks so ordinary, you'd think nothing was wrong with it. Actually, nothing IS wrong with it. But it is not as ordinary as you might think. If you think about it for a bit, you will find out why it is truly so unusual. So what is it? What is so unordinary about this paragraph?

Some friends went on a vacation to a resort. It was raining heavily and it kept raining for thirteen days.

When it rained in the morning, the afternoon was beautiful and when it rained in the afternoon, the day was blessed with a clear morning.

Overall, the friends experienced eleven nice mornings and twelve nice afternoons. Can you find out the number of days they spent on vacation?

If all Goats are Sheep and all Sheep are Deers, are all Deers Goats ?

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?

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?