Search by Topic

Resources tagged with Recurrence relations similar to The Kth Sum of N Numbers:

Filter by: Content type:
Stage:
Challenge level:

There are 7 results

Broad Topics > Sequences, Functions and Graphs > Recurrence relations

2^n -n Numbers

Stage: 5

Yatir from Israel wrote this article on numbers that can be written as $2^n-n$ where n is a positive integer.

Vecten

Stage: 5 Challenge Level:

Join in this ongoing research. Build squares on the sides of a triangle, join the outer vertices forming hexagons, build further rings of squares and quadrilaterals, investigate.

Loopy

Stage: 4 Challenge Level:

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?

Poly Fibs

Stage: 5 Challenge Level:

A sequence of polynomials starts 0, 1 and each poly is given by combining the two polys in the sequence just before it. Investigate and prove results about the roots of the polys.

Golden Powers

Stage: 5 Challenge Level:

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

Production Equation

Stage: 5 Challenge Level:

Each week a company produces X units and sells p per cent of its stock. How should the company plan its warehouse space?

And So on - and on -and On

Stage: 5 Challenge Level:

Can you find the value of this function involving algebraic fractions for x=2000?