Reasoning, convincing and proving

There are 458 NRICH Mathematical resources connected to Reasoning, convincing and proving
Marbles
problem

Marbles

Age
11 to 14
Challenge level
filled star filled star empty star
I start with a red, a green and a blue marble. I can trade any of my marbles for two others, one of each colour. Can I end up with five more blue marbles than red after a number of such trades?
Always the Same
problem

Always the Same

Age
11 to 14
Challenge level
filled star filled star filled star
Arrange the numbers 1 to 16 into a 4 by 4 array. Choose a number. Cross out the numbers on the same row and column. Repeat this process. Add up you four numbers. Why do they always add up to 34?
Rule of Three
problem

Rule of Three

Age
11 to 14
Challenge level
filled star empty star empty star
If it takes four men one day to build a wall, how long does it take 60,000 men to build a similar wall?
No Right Angle Here
problem

No Right Angle Here

Age
14 to 16
Challenge level
filled star filled star filled star
Prove that the internal angle bisectors of a triangle will never be perpendicular to each other.
Number Sandwiches
problem

Number Sandwiches

Age
7 to 14
Challenge level
filled star filled star empty star
Can you arrange the digits 1, 1, 2, 2, 3 and 3 to make a Number Sandwich?
2-Digit Square
problem

2-Digit Square

Age
14 to 16
Challenge level
filled star filled star filled star
A 2-Digit number is squared. When this 2-digit number is reversed and squared, the difference between the squares is also a square. What is the 2-digit number?
Quadratic Harmony
problem

Quadratic Harmony

Age
16 to 18
Challenge level
filled star empty star empty star
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.
Mechanical Integration
problem

Mechanical Integration

Age
16 to 18
Challenge level
filled star filled star empty star
To find the integral of a polynomial, evaluate it at some special points and add multiples of these values.
Loopy
problem

Loopy

Age
14 to 16
Challenge level
filled star empty star empty star
Investigate sequences given by $a_n = \frac{1+a_{n-1}}{a_{n-2}}$ for different choices of the first two terms. Make a conjecture about the behaviour of these sequences. Can you prove your conjecture?
Knight Defeated
problem

Knight Defeated

Age
14 to 16
Challenge level
filled star empty star empty star
The knight's move on a chess board is 2 steps in one direction and one step in the other direction. Prove that a knight cannot visit every square on the board once and only (a tour) on a 2 by n board for any value of n. How many ways can a knight do this on a 3 by 4 board?