Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Route to Root:

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

There are 183 results

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

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

Russian Cubes

Stage: 4 Challenge Level: Challenge Level:1

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

problem icon

Dalmatians

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

Investigate the sequences obtained by starting with any positive 2 digit number (10a+b) and repeatedly using the rule 10a+b maps to 10b-a to get the next number in the sequence.

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

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

Triangle Incircle Iteration

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

Keep constructing triangles in the incircle of the previous triangle. What happens?

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

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

Archimedes and Numerical Roots

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

The problem is how did Archimedes calculate the lengths of the sides of the polygons which needed him to be able to calculate square roots?

problem icon

Plus or Minus

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

Make and prove a conjecture about the value of the product of the Fibonacci numbers $F_{n+1}F_{n-1}$.

problem icon

Recent Developments on S.P. Numbers

Stage: 5

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.

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

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

Doodles

Stage: 4 Challenge Level: Challenge Level:1

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

problem icon

Janine's Conjecture

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

Janine noticed, while studying some cube numbers, that if you take three consecutive whole numbers and multiply them together and then add the middle number of the three, you get the middle number. . . .

problem icon

Perfectly Square

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

The sums of the squares of three related numbers is also a perfect square - can you explain why?

problem icon

The Root Cause

Stage: 5 Challenge Level: Challenge Level:1

Prove that if a is a natural number and the square root of a is rational, then it is a square number (an integer n^2 for some integer n.)

problem icon

Golden Eggs

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

Find a connection between the shape of a special ellipse and an infinite string of nested square roots.

problem icon

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.

problem icon

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.

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

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.

problem icon

Thousand Words

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

Here the diagram says it all. Can you find the diagram?

problem icon

N000ughty Thoughts

Stage: 4 Challenge Level: Challenge Level:1

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

problem icon

Whole Number Dynamics I

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

Number Rules - OK

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

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

problem icon

Quadratic Harmony

Stage: 5 Challenge Level: Challenge Level:1

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.

problem icon

Sperner's Lemma

Stage: 5

An article about the strategy for playing The Triangle Game which appears on the NRICH site. It contains a simple lemma about labelling a grid of equilateral triangles within a triangular frame.

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

Pythagorean Triples I

Stage: 3 and 4

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

Magic Squares II

Stage: 4 and 5

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

problem icon

Pair Squares

Stage: 5 Challenge Level: Challenge Level:1

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.

problem icon

Pythagorean Triples II

Stage: 3 and 4

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

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

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.

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

Sixational

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

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

problem icon

Square Pair Circles

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

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.

problem icon

Three Frogs

Stage: 4 Challenge Level: Challenge Level:1

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

problem icon

Dodgy Proofs

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

These proofs are wrong. Can you see why?

problem icon

Mind Your Ps and Qs

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

Sort these mathematical propositions into a series of 8 correct statements.

problem icon

Iffy Logic

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

Can you rearrange the cards to make a series of correct mathematical statements?

problem icon

On the Importance of Pedantry

Stage: 3, 4 and 5

A introduction to how patterns can be deceiving, and what is and is not a proof.

problem icon

Direct Logic

Stage: 5 Challenge Level: Challenge Level:1

Can you work through these direct proofs, using our interactive proof sorters?

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

Notty Logic

Stage: 5 Challenge Level: Challenge Level:1

Have a go at being mathematically negative, by negating these statements.

problem icon

Tree Graphs

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

problem icon

Contrary Logic

Stage: 5 Challenge Level: Challenge Level:1

Can you invert the logic to prove these statements?

problem icon

Road Maker 2

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

Can you work out where the blue-and-red brick roads end?

problem icon

Advent Calendar 2011 - Secondary

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

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