# Search by Topic

#### Resources tagged with Mathematical reasoning & proof similar to Purr-fection:

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.

### Basic Rhythms

##### Stage: 5 Challenge Level:

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

### Prime AP

##### Stage: 5 Challenge Level:

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

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

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

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

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

### Symmetric Tangles

##### Stage: 4

The tangles created by the twists and turns of the Conway rope trick are surprisingly symmetrical. Here's why!

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

### N000ughty Thoughts

##### Stage: 4 Challenge Level:

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

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

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

### Take Three from Five

##### Stage: 4 Challenge Level:

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?

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

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

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

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

### Proof of Pick's Theorem

##### Stage: 5 Challenge Level:

Follow the hints and prove Pick's Theorem.

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

### Polite Numbers

##### Stage: 5 Challenge Level:

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?

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

### DOTS Division

##### Stage: 4 Challenge Level:

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

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

### Exhaustion

##### Stage: 5 Challenge Level:

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

### Big, Bigger, Biggest

##### Stage: 5 Challenge Level:

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

### Sixational

##### Stage: 4 and 5 Challenge Level:

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

##### Stage: 5 Challenge Level:

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.

### Magic Squares II

##### Stage: 4 and 5

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

### Pair Squares

##### Stage: 5 Challenge Level:

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.

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

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

### Mind Your Ps and Qs

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

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

### Iffy Logic

##### Stage: 4 and 5 Challenge Level:

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

### Binary Sequences

##### Stage: 5 Challenge Level:

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.

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

### Direct Logic

##### Stage: 5 Challenge Level:

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

### Contrary Logic

##### Stage: 5 Challenge Level:

Can you invert the logic to prove these statements?

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

### Dodgy Proofs

##### Stage: 5 Challenge Level:

These proofs are wrong. Can you see why?

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

### L-triominoes

##### Stage: 4 Challenge Level:

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

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

### Thousand Words

##### Stage: 5 Challenge Level:

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

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

### Proof: A Brief Historical Survey

##### Stage: 4 and 5

If you think that mathematical proof is really clearcut and universal then you should read this article.

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

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

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