Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Dirisibly Yours:

Filter by: Content type:
Stage:
Challenge level:

There are 183 results

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

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.

What Numbers Can We Make Now?

Stage: 3 and 4 Challenge Level:

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

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.

Prime AP

Stage: 4 Challenge Level:

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?

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.

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.

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

Take Three from Five

Stage: 3 and 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?

More Sums of Squares

Stage: 5

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

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

Common Divisor

Stage: 4 Challenge Level:

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

Particularly General

Stage: 5 Challenge Level:

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

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

N000ughty Thoughts

Stage: 4 Challenge Level:

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

Big, Bigger, Biggest

Stage: 5 Challenge Level:

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

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?

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.

Ordered Sums

Stage: 4 Challenge Level:

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

Stage: 4 Challenge Level:

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

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?

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.

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.

How Many Solutions?

Stage: 5 Challenge Level:

Find all the solutions to the this equation.

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.

The Triangle Game

Stage: 3 and 4 Challenge Level:

Can you discover whether this is a fair game?

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.

Proofs with Pictures

Stage: 5

Some diagrammatic 'proofs' of algebraic identities and inequalities.

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

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.

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.

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.

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.

Unit Interval

Stage: 4 and 5 Challenge Level:

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

Generally Geometric

Stage: 5 Challenge Level:

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

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.

Number Rules - OK

Stage: 4 Challenge Level:

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

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.

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.

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.

Stage: 5 Short Challenge Level:

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

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.

Find the Fake

Stage: 4 Challenge Level:

There are 12 identical looking coins, one of which is a fake. The counterfeit coin is of a different weight to the rest. What is the minimum number of weighings needed to locate the fake coin?

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.

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.

Proof of Pick's Theorem

Stage: 5 Challenge Level:

Follow the hints and prove Pick's Theorem.

Pythagorean Triples II

Stage: 3 and 4

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

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?

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.