Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Sixty-seven Squared:

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

There are 186 results

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

problem icon

Proof Sorter - Geometric Series

Stage: 5 Challenge Level: Challenge Level:1

This is an interactivity in which you have to sort into the correct order the steps in the proof of the formula for the sum of a geometric series.

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

Basic Rhythms

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

Explore a number pattern which has the same symmetries in different bases.

problem icon

Composite Notions

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

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

problem icon

The Triangle Game

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

Can you discover whether this is a fair game?

problem icon

More Sums of Squares

Stage: 5

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

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

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

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

Proof Sorter - Quadratic Equation

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

This is an interactivity in which you have to sort the steps in the completion of the square into the correct order to prove the formula for the solutions of quadratic equations.

problem icon

Unit Interval

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

Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?

problem icon

Generally Geometric

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

Generalise the sum of a GP by using derivatives to make the coefficients into powers of the natural numbers.

problem icon

Integral Inequality

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

An inequality involving integrals of squares of functions.

problem icon

To Prove or Not to Prove

Stage: 4 and 5

A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.

problem icon

Natural Sum

Stage: 4 Challenge Level: Challenge Level:1

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

problem icon

An Alphanumeric

Stage: 5

Freddie Manners, of Packwood Haugh School in Shropshire solved an alphanumeric without using the extra information supplied and this article explains his reasoning.

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

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

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

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

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

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

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.

problem icon

DOTS Division

Stage: 4 Challenge Level: Challenge Level:1

Take any pair of two digit numbers x=ab and y=cd where, without loss of generality, ab > cd . Form two 4 digit numbers r=abcd and s=cdab and calculate: {r^2 - s^2} /{x^2 - y^2}.

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

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

Picturing Pythagorean Triples

Stage: 4 and 5

This article discusses how every Pythagorean triple (a, b, c) can be illustrated by a square and an L shape within another square. You are invited to find some triples for yourself.

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

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

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

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

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 Sorter - Sum of an AP

Stage: 5 Challenge Level: Challenge Level:1

Use this interactivity to sort out the steps of the proof of the formula for the sum of an arithmetic series. The 'thermometer' will tell you how you are doing

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

Contrary Logic

Stage: 5 Challenge Level: Challenge Level:1

Can you invert the logic to prove these statements?

problem icon

An Introduction to Number Theory

Stage: 5

An introduction to some beautiful results of Number Theory

problem icon

Never Prime

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

If a two digit number has its digits reversed and the smaller of the two numbers is subtracted from the larger, prove the difference can never be prime.

problem icon

Notty Logic

Stage: 5 Challenge Level: Challenge Level:1

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

problem icon

The Clue Is in the Question

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

This problem is a sequence of linked mini-challenges leading up to the proof of a difficult final challenge, encouraging you to think mathematically. Starting with one of the mini-challenges, how. . . .

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

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.

problem icon

L-triominoes

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

L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?

problem icon

Geometric Parabola

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

Explore what happens when you draw graphs of quadratic equations with coefficients based on a geometric sequence.

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

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

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

Binary Sequences

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

Show that the infinite set of finite (or terminating) binary sequences can be written as an ordered list whereas the infinite set of all infinite binary sequences cannot.

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?