Search by Topic

Resources tagged with Mathematical reasoning & proof similar to The Use of Mathematics in Computer Games:

Filter by: Content type:
Stage:
Challenge level: Challenge Level:1 Challenge Level:2 Challenge Level:3

There are 164 results

problem Icon

Problem Solving, Using and Applying and Functional Mathematics

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

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.

problem Icon

Magic W Wrap Up

Stage: 5 Challenge Level: Challenge Level:1

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.

problem Icon

Stone Henge

Stage: 5 Challenge Level: Challenge Level:1

Explain why, when moving heavy objects on rollers, the object moves twice as fast as the rollers. Try a similar experiment yourself.

problem Icon

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.

problem Icon

Cube Net

Stage: 5 Challenge Level: Challenge Level:2 Challenge Level:2

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

problem Icon

Symmetric Tangles

Stage: 4

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

problem Icon

Knight Defeated

Stage: 4 Challenge Level: Challenge Level:1

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

problem Icon

The Frieze Tree

Stage: 4

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

problem Icon

Flexi Quad Tan

Stage: 5 Challenge Level: Challenge Level:1

As a quadrilateral Q is deformed (keeping the edge lengths constnt) the diagonals and the angle X between them change. Prove that the area of Q is proportional to tanX.

problem Icon

Sprouts

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

problem Icon

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

Stage: 3, 4 and 5 Challenge Level: Challenge Level: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. . . .

problem Icon

Magic Squares II

Stage: 4 and 5

An article which gives an account of some properties of magic squares.

problem Icon

Truth Tables and Electronic Circuits

Stage: 2, 3 and 4

Investigate circuits and record your findings in this simple introduction to truth tables and logic.

problem Icon

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.

problem Icon

Whole Number Dynamics IV

Stage: 4 and 5

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?

problem Icon

Middle Man

Stage: 5 Challenge Level: Challenge Level:1

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?

problem Icon

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.

problem Icon

Ordered Sums

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

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

problem Icon

Exhaustion

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

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

problem Icon

Euler's Formula and Topology

Stage: 4 and 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. . . .

problem Icon

Picture Story

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

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

problem Icon

Classifying Solids Using Angle Deficiency

Stage: 3 and 4

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

problem Icon

N000ughty Thoughts

Stage: 4 Challenge Level: Challenge Level:1

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

problem Icon

Impossible Sandwiches

Stage: 3, 4 and 5

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.

problem Icon

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.

problem Icon

Russian Cubes

Stage: 4 Challenge Level: Challenge Level:1

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

problem Icon

Tree Graphs

Stage: 4 Challenge Level: Challenge Level:1

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

problem Icon

Contrary Logic

Stage: 5 Challenge Level: Challenge Level:1

Can you invert the logic to prove these statements?

problem Icon

Whole Number Dynamics III

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

problem Icon

Diverging

Stage: 5 Challenge Level: Challenge Level:1

Show that for natural numbers x and y if x/y > 1 then x/y>(x+1)/(y+1}>1. Hence prove that the product for i=1 to n of [(2i)/(2i-1)] tends to infinity as n tends to infinity.

problem Icon

Whole Number Dynamics I

Stage: 3, 4 and 5

The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.

problem Icon

Postage

Stage: 4 Challenge Level: Challenge Level:1

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

problem Icon

Doodles

Stage: 4 Challenge Level: Challenge Level:1

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

problem Icon

Whole Number Dynamics II

Stage: 3, 4 and 5

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.

problem Icon

Logic, Truth Tables and Switching Circuits Challenge

Stage: 2, 3, 4 and 5

Learn about the link between logical arguments and electronic circuits. Investigate the logical connectives by making and testing your own circuits and fill in the blanks in truth tables to. . . .

problem Icon

The Great Weights Puzzle

Stage: 4 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

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?

problem Icon

Little and Large

Stage: 5 Challenge Level: Challenge Level:2 Challenge Level: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 vertices?

problem Icon

Continued Fractions II

Stage: 5

In this article we show that every whole number can be written as a continued fraction of the form k/[1+k/[1+k/etc.]].

problem Icon

Pythagorean Triples II

Stage: 4 and 5

This is the second article on right-angled triangles whose edge lengths are whole numbers.

problem Icon

Proof of Pick's Theorem

Stage: 5 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Follow the hints and prove Pick's Theorem.

problem Icon

Euclid's Algorithm II

Stage: 5

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.

problem Icon

Fractional Calculus III

Stage: 5

Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.

problem Icon

Pythagorean Triples I

Stage: 4 and 5

The first of two articles on Pythagorean Triples which asks how many right angled triangles can you find with the lengths of each side exactly a whole number measurement. Try it!

problem Icon

The Triangle Game

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

Can you discover whether this is a fair game?

problem Icon

Shape and Territory

Stage: 5 Challenge Level: Challenge Level:1

If for any triangle ABC tan(A - B) + tan(B - C) + tan(C - A) = 0 what can you say about the triangle?

problem Icon

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.

problem Icon

Where Do We Get Our Feet Wet?

Stage: 5

Jenny Piggott chose this article. Professor Körner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.

problem Icon

Try to Win

Stage: 5

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

problem Icon

Proofs with Pictures

Stage: 5

Some diagrammatic 'proofs' of algebraic identities and inequalities.

problem Icon

Telescoping Functions

Stage: 5

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.