Answer Key — HSF.IF.A.3

For parents and tutors

Do not share with students before practice tests.

Practice Problems — Sets 1–10

| Set | Guidance | | --- | --- | | Set 1 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 2 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 3 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 4 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 5 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 6 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 7 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 8 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 9 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 10 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. |

Practice Problems — Sets 11–20

| Set | Guidance | | --- | --- | | Set 11 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 12 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 13 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 14 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 15 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 16 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 17 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 18 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 19 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. | | Set 20 | Recognize that sequences are functions, sometimes defined recursively… — verify written work and accept reasonable drawings. |

Review tiers 1–10

• Checklists are parent-judged.
• Written items: verify against practice set patterns.
• Standard text: 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.

Practice test scoring

| Tier | Pass guidance | | --- | --- | | 1–3 | Most oral tasks smooth; majority of written correct | | 4–6 | 7/10+ total with clear understanding | | 7–8 | 9/12+ with explanations | | 9–10 | Near-perfect; ready to move on |

___________________________ ___________________________ ___________________________ ___________________________ ___________________________ ___________________________