A short challenge concerning prime numbers.
A game in which players take it in turns to choose a number. Can you block your opponent?
Take any prime number greater than 3 , square it and subtract one. Working on the building blocks will help you to explain what is special about your results.
How many divisors does factorial n (n!) have?
An introduction to proof by contradiction, a powerful method of mathematical proof.
Make a line of green and a line of yellow rods so that the lines differ in length by one (a white rod)
This group tasks allows you to search for arithmetic progressions in the prime numbers. How many of the challenges will you discover for yourself?