You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
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.
This is a most unusual paragraph. How quickly can you find out what is so unusual about it? It looks so ordinary, you'd think nothing was wrong with it. Actually, nothing IS wrong with it. But it is not as ordinary as you might think. If you think about it for a bit, you will find out why it is truly so unusual. So what is it? What is so unordinary about this paragraph?