KAJIAN BARISAN FIBONACCI DAN APLIKASINYA PADA SUKU BARISAN YANG POSITIF

Rofitasari, Rosma (2009) KAJIAN BARISAN FIBONACCI DAN APLIKASINYA PADA SUKU BARISAN YANG POSITIF. Other thesis, University of Muhammadiyah Malang.

Preview

Text KAJIAN_BARISAN_FIBONACCI_DAN_APLIKASINYA_PADA_SUKU_BARISAN__YANG_POSITIF.pdf Download (66Kb) | Preview

Abstract

In general, the problems that occur in the fibonacci sequence is to determine the n- tribe ( ) . So to find , so please be at least two tribes, regardless of the number-the number that are in sequence if the number is positive ornegative. , From the description, it appears a simple thought that is how to determine the tribe- 1 ( ) and to the tribe- 2 ( ) of the tribe to - n ( ) on a sequence{ } that have the characteristics such as where the fibonacci sequence numbers worth positive. The sequence is, , where each . So the purpose of writing this is to determine how to describe your tribe to- 1 ( ) and to the tribe- 2 ( ) values, to positive from tribe- n ( ) with the fibonacci sequence (fibonaccinumber) From the results of the discussion can be concluded that if the tribe is known to - n ( ) to search for the tribe to determine tribe to – 1 ( ) and to the tribe– 2 ( ) values, with positive numbers fibonacci ( ) is using solution following: dan , with where m is a positive for the paramemeter and

Actions (login required)

View Item