Use explicit rules to write sequences recursively

Use explicit rules to write sequences recursively

In this lesson you will learn that an arithmetic sequence can be written recursively by reviewing the explicit rule for an arithmetic sequence.

ADDITIONAL MATERIALS

Lesson slides https://docs.google.com/presentation/d/1qQVt9RdPdEg6u0ojA4maGEVjeK3eccac/edit?usp=drivesdk&ouid=103344685123288532282&rtpof=true&sd=true

STANDARDS

CCSS.HSF-IF.A.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 𝘧(0) = 𝘧(1) = 1, 𝘧(𝘯+1) = 𝘧(𝘯) + 𝘧(𝘯-1) for 𝘯 greater than or equal to 1.

IN.PC.F.3 Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers.

FL.MAFS.912.F-IF.1.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 𝘧(0) = 𝘧(1) = 1, 𝘧(𝘯+1) = 𝘧(𝘯) + 𝘧(𝘯-1) for 𝘯 greater than or equal to 1.

explicitruleswrite