# Search by Topic

#### Resources tagged with Mathematical induction similar to Ab Surd Ity:

Filter by: Content type:
Stage:
Challenge level:

### There are 22 results

Broad Topics > Using, Applying and Reasoning about Mathematics > Mathematical induction

### Farey Fibonacci

##### Stage: 5 Short Challenge Level:

Investigate Farey sequences of ratios of Fibonacci numbers.

### Fibonacci Fashion

##### Stage: 5 Challenge Level:

What have Fibonacci numbers to do with solutions of the quadratic equation x^2 - x - 1 = 0 ?

### Golden Powers

##### Stage: 5 Challenge Level:

You add 1 to the golden ratio to get its square. How do you find higher powers?

### Farey Neighbours

##### Stage: 5 Challenge Level:

Farey sequences are lists of fractions in ascending order of magnitude. Can you prove that in every Farey sequence there is a special relationship between Farey neighbours?

### Golden Fractions

##### Stage: 5 Challenge Level:

Find the link between a sequence of continued fractions and the ratio of succesive Fibonacci numbers.

### Tens

##### Stage: 5 Challenge Level:

When is $7^n + 3^n$ a multiple of 10? Can you prove the result by two different methods?

### Growing

##### Stage: 5 Challenge Level:

Which is larger: (a) 1.000001^{1000000} or 2? (b) 100^{300} or 300! (i.e.factorial 300)

### Obviously?

##### Stage: 4 and 5 Challenge Level:

Find the values of n for which 1^n + 8^n - 3^n - 6^n is divisible by 6.

### Elevens

##### Stage: 5 Challenge Level:

Add powers of 3 and powers of 7 and get multiples of 11.

### Dirisibly Yours

##### Stage: 5 Challenge Level:

Find and explain a short and neat proof that 5^(2n+1) + 11^(2n+1) + 17^(2n+1) is divisible by 33 for every non negative integer n.

### OK! Now Prove It

##### Stage: 5 Challenge Level:

Make a conjecture about the sum of the squares of the odd positive integers. Can you prove it?

### Particularly General

##### Stage: 5 Challenge Level:

By proving these particular identities, prove the existence of general cases.

### Water Pistols

##### Stage: 5 Challenge Level:

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?

### An Introduction to Mathematical Induction

##### Stage: 5

This article gives an introduction to mathematical induction, a powerful method of mathematical proof.

### Binary Squares

##### Stage: 5 Challenge Level:

If a number N is expressed in binary by using only 'ones,' what can you say about its square (in binary)?

##### Stage: 4 Challenge Level:

A walk is made up of diagonal steps from left to right, starting at the origin and ending on the x-axis. How many paths are there for 4 steps, for 6 steps, for 8 steps?

### One Basket or Group Photo

##### Stage: 2, 3, 4 and 5 Challenge Level:

Libby Jared helped to set up NRICH and this is one of her favourite problems. It's a problem suitable for a wide age range and best tackled practically.

### Counting Binary Ops

##### Stage: 4 Challenge Level:

How many ways can the terms in an ordered list be combined by repeating a single binary operation. Show that for 4 terms there are 5 cases and find the number of cases for 5 terms and 6 terms.

### Converging Product

##### Stage: 5 Challenge Level:

In the limit you get the sum of an infinite geometric series. What about an infinite product (1+x)(1+x^2)(1+x^4)... ?

### Symmetric Tangles

##### Stage: 4

The tangles created by the twists and turns of the Conway rope trick are surprisingly symmetrical. Here's why!

### Gosh Cosh

##### Stage: 5 Challenge Level:

Explore the hyperbolic functions sinh and cosh using what you know about the exponential function.

### Overarch 2

##### Stage: 5 Challenge Level:

Bricks are 20cm long and 10cm high. How high could an arch be built without mortar on a flat horizontal surface, to overhang by 1 metre? How big an overhang is it possible to make like this?
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "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=-40&cl=4&cldcmpid=274", "fetch_time": 1503223444000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2017-34/segments/1502886106367.1/warc/CC-MAIN-20170820092918-20170820112918-00299.warc.gz", "warc_record_offset": 326058091, "warc_record_length": 6868, "token_count": 970, "char_count": 3963, "score": 3.9375, "int_score": 4, "crawl": "CC-MAIN-2017-34", "snapshot_type": "latest", "language": "en", "language_score": 0.8105878233909607, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00023-of-00064.parquet"}