## You are here

HomeA specific example on Recursive Functions

## Primary tabs

# A specific example on Recursive Functions

LaTeX field for this problem:

Suppose that the function $f\colon\mathbb{N}\rightarrow\mathbb{N}$ is defined recursively by:

$f(n)=2f(n-1)+1;f(1)=3.$ |

Which of the following functions is equal to $f$?

- (a)
$f(n)=2^{{n+2}}-5$

- (b)
$f(n)=2^{n}+2n-1$

- (c)
$f(n)=2^{{n-1}}+3$

- (d)
$f(n)=2^{{n+1}}-1$

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections

## Info

Submitted by: unlord

Added: 2013-05-05 - 19:49

Added: 2013-05-05 - 19:49