A fresh card pile is taken out of a box (the pile has 54 cards including 2 jokers). One joker is taken out and then the cards are shuffled for a good amount of times. After shuffling, two piles are made by dividing that one pile.



What is the possibility that one of the piles will have a card sequence from A to K in order?

There is one four-digit whole number n, such that the last four digits of n2 are the original number n

You are in a room with no metal objects except for two iron rods. Only one of them is a magnet.
How can you identify which one is a magnet?

A car meter reading shows 72927 miles a palindromic number.
what is the minimum number of miles you would need to travel to see another palindromic number on the car meter reading?

There are 2 cops parked along a one-way street looking for traffic violations. They spot a taxi driver going in the wrong direction, yet they do nothing.

Why?

A Car is crossing a bridge 2 miles long. The bridge can only hold 10000 lbs, which is the exact weight of the car. The Car makes it half way across the bridge and stops. A bird lands on the car. Does the bridge collapse? Explain.

A Shopkeeper sold a few chickens to four different customers on a particular day. It was such that each customer purchased half of the remaining chickens and half the chicken more.

Can you find out how many chicken were sold by the shopkeeper on that day if we tell you that the fourth customer bought a single chicken ?

0 0 0 = 6
1 1 1 = 6
2 2 2 = 6
3 3 3 = 6
4 4 4 = 6
5 5 5 = 6
6 6 6 = 6
7 7 7 = 6
8 8 8 = 6
9 9 9 = 6

You can use any mathematical symbols in the space provided to make all above algebraic expressions true.

Two friends were betting. One said to the other, "The coin will be flipped twenty times and each time the coin lands on the head, I will give you $2 and each time it lands on the tale, you will give me $3." After flipping the coin twenty times not a single penny was exchanged among them.

How many times did the coin land on heads?

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?