Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Remainder Hunt:

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

Mod 3

Stage: 4 Challenge Level: Challenge Level:1

Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.

problem icon

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.

problem icon

What Numbers Can We Make Now?

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

Imagine we have four bags containing numbers from a sequence. What numbers can we make now?

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

A Biggy

Stage: 4 Challenge Level: Challenge Level:1

Find the smallest positive integer N such that N/2 is a perfect cube, N/3 is a perfect fifth power and N/5 is a perfect seventh power.

problem icon

Prime AP

Stage: 4 Challenge Level: Challenge Level:1

Show that if three prime numbers, all greater than 3, form an arithmetic progression then the common difference is divisible by 6. What if one of the terms is 3?

problem icon

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 orf two or more cubes.

problem icon

More Sums of Squares

Stage: 5

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

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

Take Three from Five

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

Caroline and James pick sets of five numbers. Charlie chooses three of them that add together to make a multiple of three. Can they stop him?

problem icon

Modular Fractions

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

We only need 7 numbers for modulus (or clock) arithmetic mod 7 including working with fractions. Explore how to divide numbers and write fractions in modulus arithemtic.

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

Water Pistols

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

With n people anywhere in a field each shoots a water pistol at the nearest person. In general who gets wet? What difference does it make if n is odd or even?

problem icon

Common Divisor

Stage: 4 Challenge Level: Challenge Level:1

Find the largest integer which divides every member of the following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.

problem icon

For What?

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

Prove that if the integer n is divisible by 4 then it can be written as the difference of two squares.

problem icon

Polite Numbers

Stage: 5 Challenge Level: Challenge Level:1

A polite number can be written as the sum of two or more consecutive positive integers. Find the consecutive sums giving the polite numbers 544 and 424. What characterizes impolite numbers?

problem icon

Power Mad!

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

Powers of numbers behave in surprising ways. Take a look at some of these and try to explain why they are true.

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

Big, Bigger, Biggest

Stage: 5 Challenge Level: Challenge Level:1

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

problem icon

How Many Solutions?

Stage: 5 Challenge Level: Challenge Level:1

Find all the solutions to the this equation.

problem icon

Power Quady

Stage: 4 Challenge Level: Challenge Level:1

Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.

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

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

Particularly General

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

By proving these particular identities, prove the existence of general cases.

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.

problem icon

Binomial

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

By considering powers of (1+x), show that the sum of the squares of the binomial coefficients from 0 to n is 2nCn

problem icon

Why 24?

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

Take any prime number greater than 3 , square it and subtract one. Working on the building blocks will help you to explain what is special about your results.

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

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

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

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

Similarly So

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

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.

problem icon

Proofs with Pictures

Stage: 5

Some diagrammatic 'proofs' of algebraic identities and inequalities.

problem icon

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.

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

Mediant

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

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.

problem icon

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

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

The Triangle Game

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

Can you discover whether this is a fair game?

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

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

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

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

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

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

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

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

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.