How many noughts are at the end of these giant numbers?
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.
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.
Can you convince me of each of the following: If a square number is multiplied by a square number the product is ALWAYS a square number...
Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.
Prove that if the integer n is divisible by 4 then it can be written as the difference of two squares.
When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?
The tangles created by the twists and turns of the Conway rope trick are surprisingly symmetrical. Here's why!
How many tours visit each vertex of a cube once and only once? How many return to the starting point?
Find the largest integer which divides every member of the following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.
Suppose A always beats B and B always beats C, then would you expect A to beat C? Not always! What seems obvious is not always true. Results always need to be proved in mathematics.
Take a complicated fraction with the product of five quartics top and bottom and reduce this to a whole number. This is a numerical example involving some clever algebra.
Prove that you cannot form a Magic W with a total of 12 or less or with a with a total of 18 or more.
The country Sixtania prints postage stamps with only three values 6 lucres, 10 lucres and 15 lucres (where the currency is in lucres).Which values cannot be made up with combinations of these postage. . . .
A polite number can be written as the sum of two or more consecutive positive integers. Find the consecutive sums giving the polite numbers 544 and 424. What characterizes impolite numbers?
The nth term of a sequence is given by the formula n^3 + 11n . Find the first four terms of the sequence given by this formula and the first term of the sequence which is bigger than one million. . . .
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. . . .
An account of methods for finding whether or not a number can be written as the sum of two or more squares or as the sum of two or more cubes.
Caroline and James pick sets of five numbers. Charlie chooses three of them that add together to make a multiple of three. Can they stop him?
Let a(n) be the number of ways of expressing the integer n as an ordered sum of 1's and 2's. Let b(n) be the number of ways of expressing n as an ordered sum of integers greater than 1. (i) Calculate. . . .
A connected graph is a graph in which we can get from any vertex to any other by travelling along the edges. A tree is a connected graph with no closed circuits (or loops. Prove that every tree has. . . .
Draw a 'doodle' - a closed intersecting curve drawn without taking pencil from paper. What can you prove about the intersections?
I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?
L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?
Patterns that repeat in a line are strangely interesting. How many types are there and how do you tell one type from another?
In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).
Peter Zimmerman from Mill Hill County High School in Barnet, London gives a neat proof that: 5^(2n+1) + 11^(2n+1) + 17^(2n+1) is divisible by 33 for every non negative integer n.
Try to solve this very difficult problem and then study our two suggested solutions. How would you use your knowledge to try to solve variants on the original problem?
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
The twelve edge totals of a standard six-sided die are distributed symmetrically. Will the same symmetry emerge with a dodecahedral die?
Tom writes about expressing numbers as the sums of three squares.
We continue the discussion given in Euclid's Algorithm I, and here we shall discover when an equation of the form ax+by=c has no solutions, and when it has infinitely many solutions.
In this 7-sandwich: 7 1 3 1 6 4 3 5 7 2 4 6 2 5 there are 7 numbers between the 7s, 6 between the 6s etc. The article shows which values of n can make n-sandwiches and which cannot.
Toni Beardon has chosen this article introducing a rich area for practical exploration and discovery in 3D geometry
Here is a proof of Euler's formula in the plane and on a sphere together with projects to explore cases of the formula for a polygon with holes, for the torus and other solids with holes and the. . . .
Can you discover whether this is a fair game?
Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.
Explore what happens when you draw graphs of quadratic equations with coefficients based on a geometric sequence.
These proofs are wrong. Can you see why?
This follows up the 'magic Squares for Special Occasions' article which tells you you to create a 4by4 magicsquare with a special date on the top line using no negative numbers and no repeats.
Some diagrammatic 'proofs' of algebraic identities and inequalities.
Take a number, add its digits then multiply the digits together, then multiply these two results. If you get the same number it is an SP number.
Start with any whole number N, write N as a multiple of 10 plus a remainder R and produce a new whole number N'. Repeat. What happens?
The final of five articles which containe the proof of why the sequence introduced in article IV either reaches the fixed point 0 or the sequence enters a repeating cycle of four values.
By proving these particular identities, prove the existence of general cases.
This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.
Can you make sense of the three methods to work out the area of the kite in the square?
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
This article extends the discussions in "Whole number dynamics I". Continuing the proof that, for all starting points, the Happy Number sequence goes into a loop or homes in on a fixed point.
In this third of five articles we prove that whatever whole number we start with for the Happy Number sequence we will always end up with some set of numbers being repeated over and over again.