Question

• Fibonacci numbers, denoted as Fn, form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. • Fn = Fn-1 + Fn-2 (n > 1) • Fo = 0 and F1 = 1 • Submit the R script to write the first 100 numbers of Fibonacci sequence, i.e., F, to F99, to a file named as Fibonacci_100.txt and put in the folder in path /user/R/output/. • The output contains 100 lines • Fk-1 at the k-th line

Answer 1

nterms = 100 # first two terms n1 = 0 n2 = 1 count = 2 # check if the number of terms is valid if(nterms == 1) { print(n1) } else { write.table(n1, file = "user/R/output/fibonacci_100.txt", sep = "\n", row.names = False, col.names = False) write.table(n2, file = "user/R/output/fibonacci_100.txt", sep = "\n", row.names = False, col.names = False) while(count < nterms) { nth = n1 + n2 write.table(nth, file = "user/R/output/fibonacci_100.txt", sep = "\n", row.names = False, col.names = False) # update values n1 = n2 n2 = nth count = count + 1 } }

Output :

ܘ ܝܕ ܝܕ ܚ ܚ ܟ ܣ ܚ ܙ 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040 1346269

The output will be so on till 99 digits....