Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Torus Patterns:

Filter by: Content type:
Stage:
Challenge level:

There are 181 results

Broad Topics > Using, Applying and Reasoning about Mathematics > Mathematical reasoning & proof

Symmetric Tangles

Stage: 4

The tangles created by the twists and turns of the Conway rope trick are surprisingly symmetrical. Here's why!

Geometry and Gravity 2

Stage: 3, 4 and 5

This is the second of two articles and discusses problems relating to the curvature of space, shortest distances on surfaces, triangulations of surfaces and representation by graphs.

Sprouts Explained

Stage: 2, 3, 4 and 5

This article invites you to get familiar with a strategic game called "sprouts". The game is simple enough for younger children to understand, and has also provided experienced mathematicians with. . . .

Tree Graphs

Stage: 4 Challenge Level:

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. . . .

Euler's Formula and Topology

Stage: 5

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. . . .

Knight Defeated

Stage: 4 Challenge Level:

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. . . .

Magic W Wrap Up

Stage: 5 Challenge Level:

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.

Cube Net

Stage: 5 Challenge Level:

How many tours visit each vertex of a cube once and only once? How many return to the starting point?

Stage: 4 Challenge Level:

Four jewellers possessing respectively eight rubies, ten saphires, a hundred pearls and five diamonds, presented, each from his own stock, one apiece to the rest in token of regard; and they. . . .

Natural Sum

Stage: 4 Challenge Level:

The picture illustrates the sum 1 + 2 + 3 + 4 = (4 x 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. . . .

Exhaustion

Stage: 5 Challenge Level:

Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2

AMGM

Stage: 4 Challenge Level:

Choose any two numbers. Call them a and b. Work out the arithmetic mean and the geometric mean. Which is bigger? Repeat for other pairs of numbers. What do you notice?

The Great Weights Puzzle

Stage: 4 Challenge Level:

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?

Middle Man

Stage: 5 Challenge Level:

Mark a point P inside a closed curve. Is it always possible to find two points that lie on the curve, such that P is the mid point of the line joining these two points?

N000ughty Thoughts

Stage: 4 Challenge Level:

Factorial one hundred (written 100!) has 24 noughts when written in full and that 1000! has 249 noughts? Convince yourself that the above is true. Perhaps your methodology will help you find the. . . .

Big, Bigger, Biggest

Stage: 5 Challenge Level:

Which is the biggest and which the smallest of $2000^{2002}, 2001^{2001} \text{and } 2002^{2000}$?

Picture Story

Stage: 4 Challenge Level:

Can you see how this picture illustrates the formula for the sum of the first six cube numbers?

The Triangle Game

Stage: 3 and 4 Challenge Level:

Can you discover whether this is a fair game?

Proofs with Pictures

Stage: 5

Some diagrammatic 'proofs' of algebraic identities and inequalities.

Three Frogs

Stage: 4 Challenge Level:

Three frogs hopped onto the table. A red frog on the left a green in the middle and a blue frog on the right. Then frogs started jumping randomly over any adjacent frog. Is it possible for them to. . . .

Transitivity

Stage: 5

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.

Classifying Solids Using Angle Deficiency

Stage: 3 and 4 Challenge Level:

Toni Beardon has chosen this article introducing a rich area for practical exploration and discovery in 3D geometry

Some Circuits in Graph or Network Theory

Stage: 4 and 5

Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.

Rotating Triangle

Stage: 3 and 4 Challenge Level:

What happens to the perimeter of triangle ABC as the two smaller circles change size and roll around inside the bigger circle?

Ordered Sums

Stage: 4 Challenge Level:

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. . . .

Air Nets

Stage: 2, 3, 4 and 5 Challenge Level:

Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.

Where Do We Get Our Feet Wet?

Stage: 5

Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.

A Long Time at the Till

Stage: 4 and 5 Challenge Level:

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?

Yih or Luk Tsut K'i or Three Men's Morris

Stage: 3, 4 and 5 Challenge Level:

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. . . .

Interpolating Polynomials

Stage: 5 Challenge Level:

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.

Proximity

Stage: 4 Challenge Level:

We are given a regular icosahedron having three red vertices. Show that it has a vertex that has at least two red neighbours.

Problem Solving, Using and Applying and Functional Mathematics

Stage: 1, 2, 3, 4 and 5 Challenge Level:

Problem solving is at the heart of the NRICH site. All the problems give learners opportunities to learn, develop or use mathematical concepts and skills. Read here for more information.

Doodles

Stage: 4 Challenge Level:

A 'doodle' is a closed intersecting curve drawn without taking pencil from paper. Only two lines cross at each intersection or vertex (never 3), that is the vertex points must be 'double points' not. . . .

Russian Cubes

Stage: 4 Challenge Level:

How many different cubes can be painted with three blue faces and three red faces? A boy (using blue) and a girl (using red) paint the faces of a cube in turn so that the six faces are painted. . . .

Areas and Ratios

Stage: 4 Challenge Level:

What is the area of the quadrilateral APOQ? Working on the building blocks will give you some insights that may help you to work it out.

Advent Calendar 2011 - Secondary

Stage: 3, 4 and 5 Challenge Level:

Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.

Postage

Stage: 4 Challenge Level:

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. . . .

Square Pair Circles

Stage: 5 Challenge Level:

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.

Number Rules - OK

Stage: 4 Challenge Level:

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...

Mediant

Stage: 4 Challenge Level:

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.

Mouhefanggai

Stage: 4

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.

A Knight's Journey

Stage: 4 and 5

This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.

The Frieze Tree

Stage: 3 and 4

Patterns that repeat in a line are strangely interesting. How many types are there and how do you tell one type from another?

Whole Number Dynamics III

Stage: 4 and 5

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.

More Sums of Squares

Stage: 5

Tom writes about expressing numbers as the sums of three squares.

Composite Notions

Stage: 4 Challenge Level:

A composite number is one that is neither prime nor 1. Show that 10201 is composite in any base.

Similarly So

Stage: 4 Challenge Level:

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.

Modulus Arithmetic and a Solution to Differences

Stage: 5

Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.

Modulus Arithmetic and a Solution to Dirisibly Yours

Stage: 5

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.

A Computer Program to Find Magic Squares

Stage: 5

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.