Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Climbing Powers:

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

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

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

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

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

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

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

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

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

Dalmatians

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

Investigate the sequences obtained by starting with any positive 2 digit number (10a+b) and repeatedly using the rule 10a+b maps to 10b-a to get the next number in the sequence.

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

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

Triangle Incircle Iteration

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

Start with any triangle T1 and its inscribed circle. Draw the triangle T2 which has its vertices at the points of contact between the triangle T1 and its incircle. Now keep repeating this. . . .

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

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

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

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

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

Little and Large

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

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?

problem icon

Contrary Logic

Stage: 5 Challenge Level: Challenge Level:1

Can you invert the logic to prove these statements?

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

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

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!

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

Can it Be

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

When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?

problem icon

Pythagorean Triples II

Stage: 3 and 4

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

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

Mechanical Integration

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

To find the integral of a polynomial, evaluate it at some special points and add multiples of these values.

problem icon

Notty Logic

Stage: 5 Challenge Level: Challenge Level:1

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

problem icon

Long Short

Stage: 4 Challenge Level: Challenge Level:1

A quadrilateral inscribed in a unit circle has sides of lengths s1, s2, s3 and s4 where s1 ≤ s2 ≤ s3 ≤ s4. Find a quadrilateral of this type for which s1= sqrt2 and show s1 cannot. . . .

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

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

Calculating with Cosines

Stage: 5 Challenge Level: Challenge Level:1

If I tell you two sides of a right-angled triangle, you can easily work out the third. But what if the angle between the two sides is not a right angle?

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

A Long Time at the Till

Stage: 4 and 5 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

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?

problem icon

Pair Squares

Stage: 5 Challenge Level: Challenge Level:1

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.

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

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

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

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

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

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

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

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.

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

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

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?