You may also like

problem icon


For this challenge, you'll need to play Got It! Can you explain the strategy for winning this game with any target?

problem icon

Is There a Theorem?

Draw a square. A second square of the same size slides around the first always maintaining contact and keeping the same orientation. How far does the dot travel?

problem icon

Reverse to Order

Take any two digit number, for example 58. What do you have to do to reverse the order of the digits? Can you find a rule for reversing the order of digits for any two digit number?

Weekly Problem 37 - 2013

Stage: 3 Challenge Level: Challenge Level:1

The number of diagonals in an n-sided polygon is $\frac{1}{2}n(n-3)$ .

This can be used to show that A to D are all correct. A quadrilateral has half as many diagonals as it has sides, not twice as many.

This problem is taken from the UKMT Mathematical Challenges.

View the previous week's solution
View the current weekly problem