An evil man kidnapped someone and made them take one of two pills. One was harmless, but the other was poisonous. Whichever pill the victim took, the kidnapper took the other one. The victim took their pill with water and died. The kidnapper survived. How did the kidnapper get the harmless pill?
We have arranged an array of numbers below. What you have to do is use any kind of mathematical symbol you know excluding any symbol that contains a number like cube root. You can use any amount of symbols but you have to come up with a valid equation for all of them.
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?