Explaining, convincing and proving

  • Russian Cubes
    problem

    Russian Cubes

    Age
    14 to 16
    Challenge level
    1 out of 3

    I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?

  • Natural Sum
    problem

    Natural Sum

    Age
    14 to 16
    Challenge level
    1 out of 3

    The picture illustrates the sum 1 + 2 + 3 + 4 = (4 × 5)/2. Prove the general formula for the sum of the first n natural numbers and the formula for the sum of the cubes of the first n natural numbers.

  • N000ughty thoughts
    problem

    N000ughty

    Age
    14 to 16
    Challenge level
    1 out of 3

    How many noughts are at the end of these giant numbers?

  • Euler's Squares
    problem

    Euler's Squares

    Age
    14 to 16
    Challenge level
    1 out of 3

    Euler found four whole numbers such that the sum of any two of the numbers is a perfect square...

  • Our Ages
    problem

    Our Ages

    Age
    14 to 16
    Challenge level
    1 out of 3

    I am exactly n times my daughter's age. In m years I shall be ... How old am I?

  • Mod 3
    problem

    Mod 3

    Age
    14 to 16
    Challenge level
    1 out of 3

    Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.

  • Fitting In
    problem

    Fitting In

    Age
    14 to 16
    Challenge level
    1 out of 3

    The largest square which fits into a circle is ABCD and EFGH is a square with G and H on the line CD and E and F on the circumference of the circle. Show that AB = 5EF. Similarly the largest equilateral triangle which fits into a circle is LMN and PQR is an equilateral triangle with P and Q on the line LM and R on the circumference of the circle. Show that LM = 3PQ

  • A Biggy
    problem

    A Biggy

    Age
    14 to 16
    Challenge level
    1 out of 3

    Find the smallest positive integer N such that N/2 is a perfect cube, N/3 is a perfect fifth power and N/5 is a perfect seventh power.

  • Knight Defeated
    problem

    Knight Defeated

    Age
    14 to 16
    Challenge level
    1 out of 3

    The knight's move on a chess board is 2 steps in one direction and one step in the other direction. Prove that a knight cannot visit every square on the board once and only (a tour) on a 2 by n board for any value of n. How many ways can a knight do this on a 3 by 4 board?

  • Loopy
    problem

    Loopy

    Age
    14 to 16
    Challenge level
    1 out of 3

    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?