MHB Recursive definition and induction

CStudent
Messages
14
Reaction score
0
Hey.

The series $a_n$ is defined by a recursive formula $a_n = a_{n-1} + a_{n-3}$ and its base case is $a_1 = 1 \ a_2 = 2 \ a_3 = 3$.
Prove that every natural number can be written as a sum (of one or more) of different elements of the series $a_n$.

Now, I know that is correct intuitively but I don't know how to prove that.
Generally, I have some problem of understanding the concept of recursion.

Thanks.
 
Physics news on Phys.org
CStudent said:
Hey.

The series $a_n$ is defined by a recursive formula $a_n = a_{n-1} + a_{n-3}$ and its base case is $a_1 = 1 \ a_2 = 2 \ a_3 = 3$.
Prove that every natural number can be written as a sum (of one or more) of different elements of the series $a_n$.

Now, I know that is correct intuitively but I don't know how to prove that.
Generally, I have some problem of understanding the concept of recursion.
Since you're unclear on the concept of recursion, it would be a good idea to calculate a few terms of the sequence. (Note that what you have here is a sequence of numbers. A series is the sum of numbers in some sequence.)

From the given info we have:
##a_1 = 1##
##a_2 = 2##
##a_3 = 3##
Using the recursion formula, we get:
##a_4 = a_3 + a_1 = 3 + 1 = 4##
##a_5 = a_4 + a_2 = 4 + 2 = 6##
##a_6 = a_5 + a_3 = 6 + 3 = 9##
and so on...
 
CStudent said:
Hey.

The series $a_n$ is defined by a recursive formula $a_n = a_{n-1} + a_{n-3}$ and its base case is $a_1 = 1 \ a_2 = 2 \ a_3 = 3$.
Prove that every natural number can be written as a sum (of one or more) of different elements of the series $a_n$.

Now, I know that is correct intuitively but I don't know how to prove that.
Generally, I have some problem of understanding the concept of recursion.

Thanks.
It's not a really easy proof, I think.

- How would you go about writing a natural number as a sum of the elements of a sequence. I think there's a rather obvious algorithm.
- What can go wrong with this algorithm. Why does it fail with powers of 3.
- How can you prove that this can't happen here. (using the recursion)
 
  • Like
Likes Greg Bernhardt
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...

Similar threads

Replies
16
Views
4K
Replies
18
Views
2K
Replies
4
Views
3K
Replies
10
Views
2K
Replies
6
Views
3K
Replies
3
Views
2K
Replies
4
Views
3K
Back
Top