Word (.docx)
Acrobat (.pdf)
Use mathematical induction to prove various concepts in number theory (such as sums of infinite integer series, divisibility statements, and parity statements), recurrence relations, and other applications.
Remarks
Example 1: Prove that the sum of the first n odd positive integers is n2.Example 2: Prove that
is divisible by 4 for n≥1 and n is integer. Example 3: Prove that for every integer n≥1,
.
General Information
Subject Area: X-Mathematics (former standards - 2008)
Grade: 912
Body of Knowledge: Discrete Mathematics
Idea: Level 3: Strategic Thinking & Complex Reasoning
Standard: Recursion - Understand and apply recursive methods to solve problems, including the use of finite differences.
Date Adopted or Revised: 09/07
Content Complexity Rating:
Level 3: Strategic Thinking & Complex Reasoning
-
More Information
Date of Last Rating: 06/07
Status: State Board Approved - Archived
Related Access Points
Alternate version of this benchmark for students with significant cognitive disabilities.
Related Resources
Vetted resources educators can use to teach the concepts and skills in this benchmark.
Student Resources
Vetted resources students can use to learn the concepts and skills in this benchmark.
Parent Resources
Vetted resources caregivers can use to help students learn the concepts and skills in this benchmark.
