filmov
tv
Create an explicit formula
Показать описание
Create an explicit formula
In this lesson you will learn how to write an explicit formula by using what we know about function notation.
ADDITIONAL MATERIALS
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.
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.
IN.PC.F.3 Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers.
In this lesson you will learn how to write an explicit formula by using what we know about function notation.
ADDITIONAL MATERIALS
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.
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.
IN.PC.F.3 Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers.