Given a set of points (x,y) with distinct x values, find a polynomial that goes through all of them, then prove some results about the existence and uniqueness of these polynomials.
If x + y = -1 find the largest value of xy by coordinate geometry, by calculus and by algebra.
Given that u>0 and v>0 find the smallest possible value of
1/u + 1/v given that u + v = 5 by different methods.
There are 12 identical looking coins, one of which is a fake. The
counterfeit coin is of a different weight to the rest. What is the
minimum number of weighings needed to locate the fake coin?
Explore what happens when you draw graphs of quadratic equations
with coefficients based on a geometric sequence.
Four jewellers share their stock. Can you work out the relative values of their gems?
Find all positive integers a and b for which the two equations:
x^2-ax+b = 0 and x^2-bx+a = 0 both have positive integer solutions.
The sum of any two of the numbers 2, 34 and 47 is a perfect square.
Choose three square numbers and find sets of three integers with
this property. Generalise to four integers.
You have twelve weights, one of which is different from the rest.
Using just 3 weighings, can you identify which weight is the odd
one out, and whether it is heavier or lighter than the rest?
I am exactly n times my daughter's age. In m years I shall be ... How old am I?
An inequality involving integrals of squares of functions.
Which set of numbers that add to 10 have the largest product?
Clearly if a, b and c are the lengths of the sides of an equilateral triangle then a^2 + b^2 + c^2 = ab + bc + ca. Is the converse true?
Given any two polynomials in a single variable it is always
possible to eliminate the variable and obtain a formula showing the
relationship between the two polynomials. Try this one.
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?
Find all the solutions to the this equation.
A, B & C own a half, a third and a sixth of a coin collection.
Each grab some coins, return some, then share equally what they had
put back, finishing with their own share. How rich are they?
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
A point moves around inside a rectangle. What are the least and the
greatest values of the sum of the squares of the distances from the
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
A composite number is one that is neither prime nor 1. Show that
10201 is composite in any base.
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.
ABCD is a square. P is the midpoint of AB and is joined to C. A line from D perpendicular to PC meets the line at the point Q. Prove AQ = AD.
Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.
Can you discover whether this is a fair game?
Some diagrammatic 'proofs' of algebraic identities and
In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).
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
If you take two tests and get a marks out of a maximum b in the first and c marks out of d in the second, does the mediant (a+c)/(b+d)lie between the results for the two tests separately.
Imagine two identical cylindrical pipes meeting at right angles and think about the shape of the space which belongs to both pipes. Early Chinese mathematicians call this shape the mouhefanggai.
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. . . .
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.
Investigate the number of points with integer coordinates on
circles with centres at the origin for which the square of the
radius is a power of 5.
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.
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.
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.
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.
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.
When if ever do you get the right answer if you add two fractions
by adding the numerators and adding the denominators?
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.
Solve this famous unsolved problem and win a prize. Take a positive
integer N. If even, divide by 2; if odd, multiply by 3 and add 1.
Iterate. Prove that the sequence always goes to 4,2,1,4,2,1...
Some puzzles requiring no knowledge of knot theory, just a careful
inspection of the patterns. A glimpse of the classification of
knots and a little about prime knots, crossing numbers and. . . .
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.
Tom writes about expressing numbers as the sums of three squares.
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.
Take any rectangle ABCD such that AB > BC. The point P is on AB
and Q is on CD. Show that there is exactly one position of P and Q
such that APCQ is a rhombus.