![]() |
||||||||||||
| VOL. I, NO. 5 |
NOVEMBER 6, 1959
|
|||||||||||
|
Oh, Brother! |
||||||||||||
|
If you think you're pretty smart and turn up your nose at younger sisters or brothers in grade school, try the following on for size. Anybody can solve this problem with only a knowledge of simple arithmetic. |
This is an ordinary problem in arithmetic (long division). Each letter represents one of the digits in the number system, i.e., 1234567890, but not necessarily in the same order. You will note that there are 10 digits and 10 letters involved. Your problem is to match them to form an ordinary arithmetic problem. It is not a matter of trial and error, but one of applying the fundamental laws of arithmetic. For example: you will note that in the first subtraction, F from F leaves the letter J. Hence J must be zero. Take it from there if you dare! Have fun. The solution will appear with another problem in the next issue. |
|||||||||||
![]() |
||||||||||||