At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions.

See more answers at brainly.com

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions

is 18

ok.i get it.but how to make the formula?

a_n=a_{n-1}+a_{n-2}

http://en.wikipedia.org/wiki/Fibonacci_number

michael are you study computer science?

so what we call that number?

sorry,can i ask you about recursive function?
i really don`t understand..
hope you can help me..

Sure, what do you need?

what is recursive function?
what i know just it will recall itself. is it?

example else of 'base case'? the easier one.
actaualy i do not understand the base case.

oh. i get it. thank you so much.
hope it will help me on final.

Likewise. Glad it was helpful!

but later can i ask you more about something like this?
my course related to this topic.

18