You are playing a game with your friend Jack. There are digits from 1 to 9. You both will take turn erasing one digit and adding it to your score. The first one to score 15 points will win the game.

Would you want to play first or second?

PS: The sum should be exactly 15.

What goes up but never comes down?

Mr. Buttons was all set to go to the village of Buttonland to meet his friend. So, he packed his bags and left for the village at 5 in the morning. Upon travelling on a road for miles, he came across a point where the road diverged into two. He was confused on which road to take. He gazed around and he saw two owls sitting on a branch. He thought he could ask for directions for the village from the two owls. So he went to the tree. There he saw a sign which read, "One owl always lies, and one is always truthful. They both fly away if you ask them more than 1 question."
Mr. Buttons was caught in the dilemma of what to ask? And from which owl to ask, since he only had one question. What should Mr. Buttons ask?

Your mother’s brother’s only brother-in-law is asleep on your couch. Who is asleep on your couch?

I purchased an awesome ice cream cone having 5 different flavour scoops.
Five flavours are pistachio, mint-chip, strawberry, marshmallow, and raspberry

I will give u some clues so that you can figure out the order of flavours from bottom to top.
1. The bottom flavour of the cone has 10 letters.
2. The marshmallow scoop is between the pistachio and the mint-chip scoop.
3. marshmallow is the raspberry scoop but below the mint-chip scoop.

So can you figure out the flavour of ice cream in order from bottom to top?

Spelt forwards I’m what you do every day, spelled backwards I’m something you hate. What am I?

I have nine bottles of wine and one of the nine bottles is poisoned.
I need to find the poisoned bottle with two facts
(1) Poison is deadly, only a sip will cost death
(2) I have two mice to do so.

How should I do it?

If 21x = 79x, what is the value of x?

How can one talk without saying a single word?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?