| 1. Prove that 462n+1 + 296·132n+1 is divisible by 1947. |
|
| 2. Show that any graph with 6 points has a triangle or three points which are not joined to each other. |
|
| 3. What is the smallest number of disks radius ½ that can cover a disk radius 1? |
|
The original problems are in Hungarian, but are no longer easy to find. Many thanks to Alexander Golovanov for the English translation.
Kürschák home
John Scholes
jscholes@kalva.demon.co.uk
8 Jan 2003
Last corrected/updated 8 Jan 2003