Error
There was an error loading the page.
Intorduces strong induction and uses it to verify the solutions of a second order linear recurrence.
Metadata
-
England schools
-
England university
-
Scotland schools
Taxonomy: mathcentre
Taxonomy: Kind of activity
Taxonomy: Context
Contributors
Feedback
From users who are members of Discrete Mathematics :
![]() |
said | Needs to be tested | 6 years, 2 months ago |
History
Daniel Mansfield 6 years, 2 months ago
Published this.Daniel Mansfield 6 years, 2 months ago
Gave some feedback: Needs to be tested
Daniel Mansfield 6 years, 2 months ago
Created this.There is only one version of this question that you have access to.
There are 2 other versions that do you not have access to.
Name | Type | Generated Value |
---|
A | integer |
-2
|
||||
B | integer |
6
|
||||
root1 | integer |
5
|
||||
root2 | integer |
4
|
||||
k | integer |
16
|
Generated value: integer
- B
- Statement
- Advice
- "Part a)" - prompt
- "Part a)" → "Gap 0." - Minimum accepted value
- "Part a)" → "Gap 0." - Maximum accepted value
- "Part a)" → "Gap 1." - Minimum accepted value
- "Part a)" → "Gap 1." - Maximum accepted value
- "Part b)" → "Gap 0." - Correct answer
- "Part b)" → "Gap 1." - Correct answer
Gap-fill
Ask the student a question, and give any hints about how they should answer this part.
Since the general term is defined by the two terms preceding it, the first two terms u0 and u1 are both base cases.
Prove the base cases:
f(0)={A}×{root1}0+{B}×{root2}0=
f(1)={A}×{root1}1+{B}×{root2}1=
Use this tab to check that this question works as expected.
Part | Test | Passed? |
---|---|---|
Gap-fill | ||
Hasn't run yet | ||
Number entry | ||
Hasn't run yet | ||
Number entry | ||
Hasn't run yet | ||
Gap-fill | ||
Hasn't run yet | ||
Mathematical expression | ||
Hasn't run yet | ||
Mathematical expression | ||
Hasn't run yet | ||
Information only |
This question is used in the following exam: