Course Content

C++ Introduction

## C++ Introduction

# Fibonacci Number with Loops

Note

In the Fibonacci sequence, the indexing starts from zero:

`F(0) = 0`

`F(1) = 1`

For any

n, then-thFibonacci number can be calculated based on the preceding two numbers in the sequence. For example,`F(2)`

=`F(1) + F(0)`

and so on.

Task

- Implement a loop structure to find the
**15th**Fibonacci number. - Output the found number.

Thanks for your feedback!

# Fibonacci Number with Loops

Note

In the Fibonacci sequence, the indexing starts from zero:

`F(0) = 0`

`F(1) = 1`

For any

n, then-thFibonacci number can be calculated based on the preceding two numbers in the sequence. For example,`F(2)`

=`F(1) + F(0)`

and so on.

Task

- Implement a loop structure to find the
**15th**Fibonacci number. - Output the found number.

Thanks for your feedback!

# Fibonacci Number with Loops

Note

In the Fibonacci sequence, the indexing starts from zero:

`F(0) = 0`

`F(1) = 1`

For any

n, then-thFibonacci number can be calculated based on the preceding two numbers in the sequence. For example,`F(2)`

=`F(1) + F(0)`

and so on.

Task

- Implement a loop structure to find the
**15th**Fibonacci number. - Output the found number.

Thanks for your feedback!

Note

In the Fibonacci sequence, the indexing starts from zero:

`F(0) = 0`

`F(1) = 1`

n, then-thFibonacci number can be calculated based on the preceding two numbers in the sequence. For example,`F(2)`

=`F(1) + F(0)`

and so on.

Task

- Implement a loop structure to find the
**15th**Fibonacci number. - Output the found number.