Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Complex Partial Fractions:

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

There are 186 results

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

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

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

Direct Logic

Stage: 5 Challenge Level: Challenge Level:1

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

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

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

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

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

Proof Sorter - Geometric Series

Stage: 5 Challenge Level: Challenge Level:1

This is an interactivity in which you have to sort into the correct order the steps in the proof of the formula for the sum of a geometric series.

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

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

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.

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

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

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

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

Polynomial Relations

Stage: 5 Challenge Level: Challenge Level:1

Given any two polynomials in a single variable it is always possible to eliminate the variable and obtain a formula showing the relationship between the two polynomials. Try this one.

problem icon

Janine's Conjecture

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

Janine noticed, while studying some cube numbers, that if you take three consecutive whole numbers and multiply them together and then add the middle number of the three, you get the middle number. . . .

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

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

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

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

Picture Story

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

Can you see how this picture illustrates the formula for the sum of the first six cube 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

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

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

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

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

Contrary Logic

Stage: 5 Challenge Level: Challenge Level:1

Can you invert the logic to prove these statements?

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

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

Notty Logic

Stage: 5 Challenge Level: Challenge Level:1

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

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

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

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

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

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

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

More Number Pyramids

Stage: 3 and 4 Challenge Level: Challenge Level:2 Challenge Level:2

When number pyramids have a sequence on the bottom layer, some interesting patterns emerge...

problem icon

Proofs with Pictures

Stage: 5

Some diagrammatic 'proofs' of algebraic identities and inequalities.

problem icon

The Triangle Game

Stage: 3 and 4 Challenge Level: Challenge Level:1

Can you discover whether this is a fair game?

problem icon

Magic Squares II

Stage: 4 and 5

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

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

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

Basic Rhythms

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

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

problem icon

Find the Fake

Stage: 4 Challenge Level: Challenge Level:1

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?

problem icon

Road Maker 2

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

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

problem icon

Tree Graphs

Stage: 5 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 has. . . .

problem icon

Mediant

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

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.