# Search by Topic

#### Resources tagged with Mathematical reasoning & proof similar to Growing:

Filter by: Content type:
Stage:
Challenge level:

### There are 183 results

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

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

### More Sums of Squares

##### Stage: 5

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

### Prime AP

##### Stage: 5 Challenge Level:

What can you say about the common difference of an AP where every term is prime?

### Big, Bigger, Biggest

##### Stage: 5 Challenge Level:

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

### A Biggy

##### Stage: 4 Challenge Level:

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.

### N000ughty Thoughts

##### Stage: 4 Challenge Level:

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

### Mod 3

##### Stage: 4 Challenge Level:

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

### Modular Fractions

##### Stage: 5 Challenge Level:

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.

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

### Plus or Minus

##### Stage: 5 Challenge Level:

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

### Particularly General

##### Stage: 5 Challenge Level:

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

### The Golden Ratio, Fibonacci Numbers and Continued Fractions.

##### Stage: 4

An iterative method for finding the value of the Golden Ratio with explanations of how this involves the ratios of Fibonacci numbers and continued fractions.

### Water Pistols

##### Stage: 5 Challenge Level:

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?

### Binomial

##### Stage: 5 Challenge Level:

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

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

##### Stage: 5 Challenge Level:

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

### How Many Solutions?

##### Stage: 5 Challenge Level:

Find all the solutions to the this equation.

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

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

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

### Proximity

##### Stage: 4 Challenge Level:

We are given a regular icosahedron having three red vertices. Show that it has a vertex that has at least two red neighbours.

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

### Rational Roots

##### Stage: 5 Challenge Level:

Given that a, b and c are natural numbers show that if sqrt a+sqrt b is rational then it is a natural number. Extend this to 3 variables.

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

##### Stage: 5 Short Challenge Level:

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

### The Triangle Game

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

Can you discover whether this is a fair game?

### Composite Notions

##### Stage: 4 Challenge Level:

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

### Round and Round

##### Stage: 4 Challenge Level:

Prove that the shaded area of the semicircle is equal to the area of the inner circle.

### Pareq Exists

##### Stage: 4 Challenge Level:

Prove that, given any three parallel lines, an equilateral triangle always exists with one vertex on each of the three lines.

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

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

### Proofs with Pictures

##### Stage: 5

Some diagrammatic 'proofs' of algebraic identities and inequalities.

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

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

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

### Magic Squares II

##### Stage: 4 and 5

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

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

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

### Tetra Inequalities

##### Stage: 5 Challenge Level:

Prove that in every tetrahedron there is a vertex such that the three edges meeting there have lengths which could be the sides of a triangle.

### Proof of Pick's Theorem

##### Stage: 5 Challenge Level:

Follow the hints and prove Pick's Theorem.

### Why 24?

##### Stage: 4 Challenge Level:

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.

### Little and Large

##### Stage: 5 Challenge Level:

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?

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

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

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

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

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

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

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