Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Lattice Points:

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

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.

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

More Sums of Squares

Stage: 5

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

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

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

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

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

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

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

Take Three from Five

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

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

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

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

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

N000ughty Thoughts

Stage: 4 Challenge Level: Challenge Level:1

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

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

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

Ordered Sums

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

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

problem icon

Our Ages

Stage: 4 Challenge Level: Challenge Level:1

I am exactly n times my daughter's age. In m years I shall be ... How old am I?

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

Prime AP

Stage: 5 Challenge Level: Challenge Level:1

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

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

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

Always Perfect

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

Show that if you add 1 to the product of four consecutive numbers the answer is ALWAYS a perfect square.

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

Notty Logic

Stage: 5 Challenge Level: Challenge Level:1

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

problem icon

Iffy Logic

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

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

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

Geometric Parabola

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

Explore what happens when you draw graphs of quadratic equations with coefficients based on a geometric sequence.

problem icon

Calculating with Cosines

Stage: 4 and 5 Challenge Level: Challenge Level:2 Challenge Level:2

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

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

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

Thousand Words

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

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

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

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

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

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

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

Pareq Exists

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

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

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

Proofs with Pictures

Stage: 5

Some diagrammatic 'proofs' of algebraic identities and inequalities.

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

Power Quady

Stage: 5 Challenge Level: Challenge Level:1

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

problem icon

Diophantine N-tuples

Stage: 4 Challenge Level: Challenge Level:1

Can you explain why a sequence of operations always gives you perfect squares?

problem icon

Euler's Squares

Stage: 4 Challenge Level: Challenge Level:1

Euler found four whole numbers such that the sum of any two of the numbers is a perfect square...

problem icon

Integral Inequality

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

An inequality involving integrals of squares of functions.

problem icon

Never Prime

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

If a two digit number has its digits reversed and the smaller of the two numbers is subtracted from the larger, prove the difference can never be prime.