ا
لسلام عليكم
بس اذا ممكن حد يساعدني بحل هذا السؤال
0,1,1,2,3,5,8,13,21,......
begins with the terms 0 and 1 and has the property that each succeeding term is the sum of the two perceding terms .
1) write a method fibonancci(n) that calculates the nth fibonacci number . incorporate this method into an application that enables the user to enter the value of n .
2) determine the largest fibonacci number that can be displayed on your system .
3) modify the application you wrote in part (a) to use double instead of into to calculate and return fibonacci numbers , and use this modified application to repeat part (b )