Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Eminit:

Filter by: Content type:
Stage:
Challenge level:

There are 179 results

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

Elevenses

Stage: 3 Challenge Level:

How many pairs of numbers can you find that add up to a multiple of 11? Do you notice anything interesting about your results?

Even So

Stage: 3 Challenge Level:

Find some triples of whole numbers a, b and c such that a^2 + b^2 + c^2 is a multiple of 4. Is it necessarily the case that a, b and c must all be even? If so, can you explain why?

Reverse to Order

Stage: 3 Challenge Level:

Take any two digit number, for example 58. What do you have to do to reverse the order of the digits? Can you find a rule for reversing the order of digits for any two digit number?

Stage: 3 Challenge Level:

Make a set of numbers that use all the digits from 1 to 9, once and once only. Add them up. The result is divisible by 9. Add each of the digits in the new number. What is their sum? Now try some. . . .

Tis Unique

Stage: 3 Challenge Level:

This addition sum uses all ten digits 0, 1, 2...9 exactly once. Find the sum and show that the one you give is the only possibility.

Take Three from Five

Stage: 3 and 4 Challenge Level:

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?

What Numbers Can We Make?

Stage: 3 Challenge Level:

Imagine we have four bags containing a large number of 1s, 4s, 7s and 10s. What numbers can we make?

Stage: 3 and 4 Challenge Level:

Powers of numbers behave in surprising ways. Take a look at some of these and try to explain why they are true.

One O Five

Stage: 3 Challenge Level:

You can work out the number someone else is thinking of as follows. Ask a friend to think of any natural number less than 100. Then ask them to tell you the remainders when this number is divided by. . . .

What Numbers Can We Make Now?

Stage: 3 and 4 Challenge Level:

Imagine we have four bags containing numbers from a sequence. What numbers can we make now?

9 Weights

Stage: 3 Challenge Level:

You have been given nine weights, one of which is slightly heavier than the rest. Can you work out which weight is heavier in just two weighings of the balance?

Eleven

Stage: 3 Challenge Level:

Replace each letter with a digit to make this addition correct.

Always the Same

Stage: 3 Challenge Level:

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?

Sticky Numbers

Stage: 3 Challenge Level:

Can you arrange the numbers 1 to 17 in a row so that each adjacent pair adds up to a square number?

Number Rules - OK

Stage: 4 Challenge Level:

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

Mod 3

Stage: 4 Challenge Level:

Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.

Concrete Wheel

Stage: 3 Challenge Level:

A huge wheel is rolling past your window. What do you see?

Children at Large

Stage: 3 Challenge Level:

There are four children in a family, two girls, Kate and Sally, and two boys, Tom and Ben. How old are the children?

Hockey

Stage: 3 Challenge Level:

After some matches were played, most of the information in the table containing the results of the games was accidentally deleted. What was the score in each match played?

Pyramids

Stage: 3 Challenge Level:

What are the missing numbers in the pyramids?

Volume of a Pyramid and a Cone

Stage: 3

These formulae are often quoted, but rarely proved. In this article, we derive the formulae for the volumes of a square-based pyramid and a cone, using relatively simple mathematical concepts.

Aba

Stage: 3 Challenge Level:

In the following sum the letters A, B, C, D, E and F stand for six distinct digits. Find all the ways of replacing the letters with digits so that the arithmetic is correct.

Clocked

Stage: 3 Challenge Level:

Is it possible to rearrange the numbers 1,2......12 around a clock face in such a way that every two numbers in adjacent positions differ by any of 3, 4 or 5 hours?

Cycle It

Stage: 3 Challenge Level:

Carry out cyclic permutations of nine digit numbers containing the digits from 1 to 9 (until you get back to the first number). Prove that whatever number you choose, they will add to the same total.

Why 24?

Stage: 4 Challenge Level:

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.

Multiplication Square

Stage: 3 Challenge Level:

Pick a square within a multiplication square and add the numbers on each diagonal. What do you notice?

Calendar Capers

Stage: 3 Challenge Level:

Choose any three by three square of dates on a calendar page. Circle any number on the top row, put a line through the other numbers that are in the same row and column as your circled number. Repeat. . . .

Not Necessarily in That Order

Stage: 3 Challenge Level:

Baker, Cooper, Jones and Smith are four people whose occupations are teacher, welder, mechanic and programmer, but not necessarily in that order. What is each person’s occupation?

Unit Fractions

Stage: 3 Challenge Level:

Consider the equation 1/a + 1/b + 1/c = 1 where a, b and c are natural numbers and 0 < a < b < c. Prove that there is only one set of values which satisfy this equation.

Tourism

Stage: 3 Challenge Level:

If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable. Decide which of these diagrams are traversable.

Chocolate Maths

Stage: 3 Challenge Level:

Pick the number of times a week that you eat chocolate. This number must be more than one but less than ten. Multiply this number by 2. Add 5 (for Sunday). Multiply by 50... Can you explain why it. . . .

Prime AP

Stage: 4 Challenge Level:

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?

Sixational

Stage: 4 and 5 Challenge Level:

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

Top-heavy Pyramids

Stage: 3 Challenge Level:

Use the numbers in the box below to make the base of a top-heavy pyramid whose top number is 200.

Online

Stage: 2 and 3 Challenge Level:

A game for 2 players that can be played online. Players take it in turns to select a word from the 9 words given. The aim is to select all the occurrences of the same letter.

N000ughty Thoughts

Stage: 4 Challenge Level:

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

A Long Time at the Till

Stage: 4 and 5 Challenge Level:

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?

A Biggy

Stage: 4 Challenge Level:

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.

The Pillar of Chios

Stage: 3 Challenge Level:

Semicircles are drawn on the sides of a rectangle ABCD. A circle passing through points ABCD carves out four crescent-shaped regions. Prove that the sum of the areas of the four crescents is equal to. . . .

Stage: 3 Challenge Level:

Choose a couple of the sequences. Try to picture how to make the next, and the next, and the next... Can you describe your reasoning?

Convex Polygons

Stage: 3 Challenge Level:

Show that among the interior angles of a convex polygon there cannot be more than three acute angles.

A Chordingly

Stage: 3 Challenge Level:

Find the area of the annulus in terms of the length of the chord which is tangent to the inner circle.

Cross-country Race

Stage: 3 Challenge Level:

Eight children enter the autumn cross-country race at school. How many possible ways could they come in at first, second and third places?

For What?

Stage: 4 Challenge Level:

Prove that if the integer n is divisible by 4 then it can be written as the difference of two squares.

Triangle Inequality

Stage: 3 Challenge Level:

ABC is an equilateral triangle and P is a point in the interior of the triangle. We know that AP = 3cm and BP = 4cm. Prove that CP must be less than 10 cm.

The Great Weights Puzzle

Stage: 4 Challenge Level:

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?

Common Divisor

Stage: 4 Challenge Level:

Find the largest integer which divides every member of the following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.

Go Forth and Generalise

Stage: 3

Spotting patterns can be an important first step - explaining why it is appropriate to generalise is the next step, and often the most interesting and important.

Postage

Stage: 4 Challenge Level:

The country Sixtania prints postage stamps with only three values 6 lucres, 10 lucres and 15 lucres (where the currency is in lucres).Which values cannot be made up with combinations of these postage. . . .

Tessellating Hexagons

Stage: 3 Challenge Level:

Which hexagons tessellate?
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://nrich.maths.org/public/leg.php?code=71&cl=3&cldcmpid=813", "fetch_time": 1475015041000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2016-40/segments/1474738661277.63/warc/CC-MAIN-20160924173741-00276-ip-10-143-35-109.ec2.internal.warc.gz", "warc_record_offset": 185486650, "warc_record_length": 10602, "token_count": 2346, "char_count": 9742, "score": 4.21875, "int_score": 4, "crawl": "CC-MAIN-2016-40", "snapshot_type": "longest", "language": "en", "language_score": 0.917479932308197, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00047-of-00064.parquet"}