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?
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 died and leaves Rs.10,000 in his will. There are 6 beneficiaries- his 3 sons and their wives. The 3 wives receive Rs.3960 of which Priyanka gets Rs.100 more than Tanu and Neha gets Rs.100 more than Priyanka.
Pramod gets twice as much as his wife, Tushar gets the same as his wife, and Prashant gets 50% more than his wife.
I am thinking of a five-digit number such that:
The first and last digits are the same, their submission is an even number and multiplication is an odd number and is equal to the fourth number. Subtract five from it and we obtain the second number. Then divide into exact halves and we get the 3rd number.