A King wants to send the diamond ring to his girlfriend securely. He got multiple locks and their corresponding keys. His girlfriend does not have any keys to these locks and if he sends the key without a lock, the key can be copied in the way. How can King send the ring to his girlfriend securely?
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?
Using the clues below, what four numbers am I thinking of?
The sum of all the numbers is 31.
One number is odd.
The highest number minus the lowest number is 7.
If you subtract the middle two numbers, it equals two.
There are no duplicate numbers.
Samuel was out for a walk when it started to rain. He did not have an umbrella and he wasn't wearing a hat. His clothes were soaked, yet not a single hair on his head got wet. How could this happen?