Or search by topic
This problem offers students the opportunity to explore numerical relationships algebraically, and use their insights to make generalisations that can then be proved.
Is it always possible to find numbers to go at the vertices given any three numbers on the edges?
Begin by spending some time looking closely at the structure of addition Arithmagons.
For solving the simpler multiplication arithmagons, finding the factors of each number is a useful method. Why is there no analagous method for addition Arithmagons?
Show that for any triangle it is always possible to construct 3 touching circles with centres at the vertices. Is it possible to construct touching circles centred at the vertices of any polygon?
Start with any number of counters in any number of piles. 2 players take it in turns to remove any number of counters from a single pile. The loser is the player who takes the last counter.
Investigate sequences given by $a_n = \frac{1+a_{n-1}}{a_{n-2}}$ for different choices of the first two terms. Make a conjecture about the behaviour of these sequences. Can you prove your conjecture?