Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Ab Surd Ity:

Filter by: Content type:
Stage:
Challenge level: Challenge Level:1 Challenge Level:2 Challenge Level:3

There are 184 results

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

problem icon

Plus or Minus

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

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

problem icon

Golden Eggs

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

Find a connection between the shape of a special ellipse and an infinite string of nested square roots.

problem icon

Proof Sorter - Quadratic Equation

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

This is an interactivity in which you have to sort the steps in the completion of the square into the correct order to prove the formula for the solutions of quadratic equations.

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

More Sums of Squares

Stage: 5

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

problem icon

Rational Roots

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

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.

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

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

How Many Solutions?

Stage: 5 Challenge Level: Challenge Level:1

Find all the solutions to the this equation.

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

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

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

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

The Root Cause

Stage: 5 Challenge Level: Challenge Level:1

Prove that if a is a natural number and the square root of a is rational, then it is a square number (an integer n^2 for some integer n.)

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?

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

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

Magic Squares II

Stage: 4 and 5

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

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

Sperner's Lemma

Stage: 5

An article about the strategy for playing The Triangle Game which appears on the NRICH site. It contains a simple lemma about labelling a grid of equilateral triangles within a triangular frame.

problem icon

To Prove or Not to Prove

Stage: 4 and 5

A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.

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

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

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

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

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

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

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

Proofs with Pictures

Stage: 5

Some diagrammatic 'proofs' of algebraic identities and inequalities.

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

Square Mean

Stage: 4 Challenge Level: Challenge Level:1

Is the mean of the squares of two numbers greater than, or less than, the square of their means?

problem icon

Square Pair Circles

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

Investigate the number of points with integer coordinates on circles with centres at the origin for which the square of the radius is a power of 5.

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

Unit Interval

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

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

problem icon

Pent

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

The diagram shows a regular pentagon with sides of unit length. Find all the angles in the diagram. Prove that the quadrilateral shown in red is a rhombus.

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

Target Six

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

Show that x = 1 is a solution of the equation x^(3/2) - 8x^(-3/2) = 7 and find all other solutions.

problem icon

The Great Weights Puzzle

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

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?

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

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

Tree Graphs

Stage: 4 Challenge Level: Challenge Level:1

A connected graph is a graph in which we can get from any vertex to any other by travelling along the edges. A tree is a connected graph with no closed circuits (or loops. Prove that every tree. . . .

problem icon

On the Importance of Pedantry

Stage: 3, 4 and 5

A introduction to how patterns can be deceiving, and what is and is not a proof.

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

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

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

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

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.

problem icon

Diverging

Stage: 5 Challenge Level: Challenge Level:1

Show that for natural numbers x and y if x/y > 1 then x/y>(x+1)/(y+1}>1. Hence prove that the product for i=1 to n of [(2i)/(2i-1)] tends to infinity as n tends to infinity.

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

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.