# Search by Topic

#### Resources tagged with Mathematical reasoning & proof similar to Euler's Formula:

Filter by: Content type:
Stage:
Challenge level:

### There are 182 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!

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

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

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

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

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

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

### 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?

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

### Truth Tables and Electronic Circuits

##### Stage: 3, 4 and 5

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

### Stonehenge

##### Stage: 5 Challenge Level:

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

### Picture Story

##### Stage: 4 Challenge Level:

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

### Exhaustion

##### Stage: 5 Challenge Level:

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

##### Stage: 4 Challenge Level:

Four jewellers share their stock. Can you work out the relative values of their gems?

### Big, Bigger, Biggest

##### Stage: 5 Challenge Level:

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

### Logic, Truth Tables and Switching Circuits

##### Stage: 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 record your findings in truth tables.

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

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

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

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

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

### N000ughty Thoughts

##### Stage: 4 Challenge Level:

How many noughts are at the end of these giant numbers?

### The Triangle Game

##### Stage: 3 and 4 Challenge Level:

Can you discover whether this is a fair game?

### 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?

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

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

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

### Doodles

##### Stage: 4 Challenge Level:

Draw a 'doodle' - a closed intersecting curve drawn without taking pencil from paper. What can you prove about the intersections?

### Russian Cubes

##### Stage: 4 Challenge Level:

I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?

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

### 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?

### Tree Graphs

##### Stage: 5 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 has. . . .

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

### Logic, Truth Tables and Switching Circuits Challenge

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

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

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

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

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

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

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

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

### Sums of Squares and Sums of Cubes

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

### Whole Number Dynamics II

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

### 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?

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

### Whole Number Dynamics V

##### Stage: 4 and 5

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.

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

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