MHB Recursive definition and induction

Click For Summary
The discussion centers on the recursive sequence defined by $a_n = a_{n-1} + a_{n-3}$ with base cases $a_1 = 1$, $a_2 = 2$, and $a_3 = 3$. Participants aim to prove that every natural number can be expressed as a sum of different elements from this series. There is a suggestion to calculate the initial terms of the sequence to better understand recursion, leading to terms like $a_4 = 4$, $a_5 = 6$, and $a_6 = 9$. The conversation also touches on potential challenges in forming sums, particularly with certain number bases, and hints at an algorithmic approach to address these challenges. Overall, the discussion seeks clarity on both the recursive definition and the proof of the summation property for natural numbers.
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
There is a nice little variation of the problem. The host says, after you have chosen the door, that you can change your guess, but to sweeten the deal, he says you can choose the two other doors, if you wish. This proposition is a no brainer, however before you are quick enough to accept it, the host opens one of the two doors and it is empty. In this version you really want to change your pick, but at the same time ask yourself is the host impartial and does that change anything. The host...

Similar threads

  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 18 ·
Replies
18
Views
3K
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K