4 people have favorited this lesson!
(C) Identify terms of arithmetic and geometric sequences when the sequences are given in function form using recursive processes
(Y6) Continue and create sequences involving whole numbers, fractions and decimals. Describe the rule used to create the sequence (ACMNA133)
HSF.IF.3 Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers. For example, the Fibonacci sequence is defined recursively by f(0) = f(1) = 1, f(n+1) = f(n) + f(n-1) for n ≥ 1.
Log in to view this lesson. If you do not have an account, subscribe now and begin your free 30 day trial.
