# algorithm 4

Solve the recurrence an=3an−1−3an−2+an−3for n>2 with a0=a1=0 and a2=1. Solve the same recurrence with the initial condition on a1 changed to a1=1.

Note by Pryhant Kielh
4 years, 8 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

First recurrence:

$a(n)=\frac{1}{2} \left(n^2-n\right)$

Second recurrence:

$a(n)=\frac{1}{2} \left(3 n-n^2\right)$

- 4 years, 8 months ago

Hi;

If this is the recurrence

$a(n) = 3 a(n - 1)- 3 a(n - 2) + a(n - 3)$

then there are many methods. perhaps the simplest is by using the techniques of experimental math.

Generate the first couple of terms

0, 0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66,...

if you do not recognize that sequence then take it over to the the OEIS. This is a tremendous online resource available to everyone so why "Rediscover America"

[a_n=\frac{1}{2} \left(n^2-n\right)/]

- 4 years, 8 months ago

Sorry, bad latexing: $a_n=\frac{1}{2} \left(n^2-n\right)$

- 4 years, 8 months ago

look easy but actually difficult. hehehe :)

- 4 years, 8 months ago