// Numbas version: finer_feedback_settings {"name": "Recurrence relations", "showstudentname": true, "showQuestionGroupNames": false, "duration": 0, "question_groups": [{"name": "Group", "pickQuestions": 1, "pickingStrategy": "all-ordered", "questions": [{"name": "Julie's copy of Recurrence - rekursjon 1", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Julie Crowley", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/113/"}], "statement": "", "variable_groups": [], "advice": "
$y(2) = 2y(2-1)-y(2-2)=2y(1)-y(0) = 2 \\cdot 1 - 0 = 2$
\n$y(3) = 2y(3-1)-y_(3-2)=2y(2)-y(1) = 2 \\cdot 2 - 1 = 3$
\n$y(4) = 2y(4-1)-y(4-2)=2y(3)-y(2) = 2 \\cdot 3 - 2 = 4$
\nSo, it looks like $y_5=5, y_6=6,...$ and $y_n=n$.
", "tags": [], "functions": {}, "rulesets": {}, "ungrouped_variables": [], "variablesTest": {"maxRuns": 100, "condition": ""}, "metadata": {"licence": "Creative Commons Attribution 4.0 International", "description": "Recurrence equations - rekursjon
"}, "preamble": {"js": "", "css": ""}, "variables": {}, "parts": [{"stepsPenalty": 0, "type": "gapfill", "gaps": [{"showCorrectAnswer": true, "correctAnswerStyle": "plain", "minValue": "2", "maxValue": "2", "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "integerPartialCredit": 0, "allowFractions": false, "notationStyles": ["plain", "en", "si-en"], "type": "numberentry", "marks": "1", "integerAnswer": true, "variableReplacements": [], "scripts": {}}, {"showCorrectAnswer": true, "correctAnswerStyle": "plain", "minValue": "3", "maxValue": "3", "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "integerPartialCredit": 0, "allowFractions": false, "notationStyles": ["plain", "en", "si-en"], "type": "numberentry", "marks": 1, "integerAnswer": true, "variableReplacements": [], "scripts": {}}, {"showCorrectAnswer": true, "correctAnswerStyle": "plain", "minValue": "4", "maxValue": "4", "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "integerPartialCredit": 0, "allowFractions": false, "notationStyles": ["plain", "en", "si-en"], "type": "numberentry", "marks": 1, "integerAnswer": true, "variableReplacements": [], "scripts": {}}, {"showCorrectAnswer": false, "answer": "n", "variableReplacementStrategy": "originalfirst", "checkvariablenames": false, "showpreview": true, "vsetrangepoints": 5, "checkingaccuracy": 0.001, "checkingtype": "absdiff", "type": "jme", "marks": 1, "scripts": {}, "variableReplacements": [], "vsetrange": [0, 1], "expectedvariablenames": []}], "variableReplacements": [], "marks": 0, "steps": [{"type": "information", "variableReplacements": [], "marks": 0, "scripts": {}, "showCorrectAnswer": true, "prompt": "Fill in for $n$ i $y_n = 2y_{n-1}-y_{n-2}$
\n$y_2 = 2y_{2-1}-y_{2-2}=2y_1-y_0 = 2 \\cdot 1 - 0 = 2$
\n$y_3 = 2y_{3-1}-y_{3-2}=2y_2-y_1 = ...$
", "variableReplacementStrategy": "originalfirst"}], "scripts": {}, "showCorrectAnswer": true, "prompt": "A sequence $y_n$ is defined by the recursive formula
\n$y_n = 2y_{n-1}-y_{n-2}$
\nwhere
\n$y(0)=0,\\;\\;y(1)=1$
\nFind the next 3 terms by using the recursion method.
\n$y(2)$ = [[0]] , $y(3)$ = [[1]] , $y(4)$ = [[2]]
\nCan you work out a direct formula for $y(n)$ = [[3]]
", "variableReplacementStrategy": "originalfirst"}], "type": "question"}, {"name": "Julie's copy of Recurrence - rekursjon 5", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Julie Crowley", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/113/"}], "metadata": {"licence": "Creative Commons Attribution 4.0 International", "description": "Recurrence equations - rekursjon
"}, "rulesets": {}, "statement": "", "variables": {}, "parts": [{"marks": 0, "variableReplacements": [], "prompt": "A sequence $y(n)$ is given by the recursive formula
\n$y(n) - 6y(n-1) +9y(n-2)= 2^n, \\;\\;y_0=1,\\;\\;y_1=2$
\nFind a direct formula for $y(n)$:
\n$y_n$ = [[0]]
", "showCorrectAnswer": true, "variableReplacementStrategy": "originalfirst", "type": "gapfill", "gaps": [{"vsetrange": [0, 1], "showpreview": true, "expectedvariablenames": [], "vsetrangepoints": 5, "checkingaccuracy": 0.001, "scripts": {}, "marks": "4", "variableReplacements": [], "checkvariablenames": false, "showCorrectAnswer": true, "variableReplacementStrategy": "originalfirst", "type": "jme", "answer": "-(3^(n+1)) + n*3^n + 2^(n+2)", "checkingtype": "absdiff"}], "scripts": {}, "stepsPenalty": 0, "steps": [{"marks": 0, "variableReplacements": [], "showCorrectAnswer": true, "variableReplacementStrategy": "originalfirst", "type": "information", "scripts": {}}]}], "variablesTest": {"maxRuns": 100, "condition": ""}, "ungrouped_variables": [], "preamble": {"css": "", "js": ""}, "functions": {}, "variable_groups": [], "advice": "", "tags": [], "type": "question"}, {"name": "Julie's copy of Recurrence - rekursjon 4", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Julie Crowley", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/113/"}], "variablesTest": {"condition": "", "maxRuns": 100}, "ungrouped_variables": [], "parts": [{"marks": 0, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "showCorrectAnswer": true, "gaps": [{"vsetrangepoints": 5, "checkingtype": "absdiff", "answer": "2^n-2", "type": "jme", "scripts": {}, "checkingaccuracy": 0.001, "checkvariablenames": false, "marks": "4", "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "showCorrectAnswer": true, "vsetrange": [0, 1], "showpreview": true, "expectedvariablenames": []}], "type": "gapfill", "scripts": {}, "prompt": "A sequence $y(n)$ is given by the recursive formula
\n$y(n) - 3y(n-1) +2y(n-2)= 0, \\;\\;n\\geq3,\\;\\;y(1)=0,\\;\\;y(2)=2$
\nFind a direct formula for $y(n)$:
\n$y(n)$ = [[0]]
"}], "variables": {}, "preamble": {"css": "", "js": ""}, "variable_groups": [], "metadata": {"licence": "Creative Commons Attribution 4.0 International", "description": "Recurrence equations - rekursjon
"}, "rulesets": {}, "statement": "", "functions": {}, "advice": "", "tags": [], "type": "question"}, {"name": "Marie's copy of Julie's copy of Recurrence - rekursjon 3", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Julie Crowley", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/113/"}, {"name": "Marie Nicholson", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/1799/"}], "variablesTest": {"condition": "", "maxRuns": 100}, "variables": {}, "tags": [], "advice": "", "statement": "", "variable_groups": [], "metadata": {"description": "Recurrence equations - rekursjon
", "licence": "Creative Commons Attribution 4.0 International"}, "functions": {}, "ungrouped_variables": [], "preamble": {"js": "", "css": ""}, "parts": [{"gaps": [{"showCorrectAnswer": true, "vsetrangepoints": 5, "checkingaccuracy": 0.001, "expectedvariablenames": [], "scripts": {}, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "type": "jme", "checkvariablenames": false, "vsetrange": [0, 1], "showpreview": true, "marks": "4", "answer": "5*3^n-2*n-3", "checkingtype": "absdiff"}], "showCorrectAnswer": true, "type": "gapfill", "marks": 0, "scripts": {}, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "prompt": "A sequence $y(n)$ is defined by the recursive formula
\n$y(n) - 3y(n-1) = -4n, \\;y(0)=2$
\nFind a recurrence formula for $y(n)$:
\n$y(n)$ = [[0]]
"}], "rulesets": {}, "type": "question"}, {"name": "Marie's copy of Julie's copy of Recurrence - rekursjon 2", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Julie Crowley", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/113/"}, {"name": "Marie Nicholson", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/1799/"}], "variablesTest": {"condition": "", "maxRuns": 100}, "tags": [], "variables": {}, "advice": "", "statement": "", "variable_groups": [], "metadata": {"description": "Recurrence equations - rekursjon
", "licence": "Creative Commons Attribution 4.0 International"}, "parts": [{"gaps": [{"showCorrectAnswer": true, "marks": "4", "checkingaccuracy": 0.001, "expectedvariablenames": [], "scripts": {}, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "type": "jme", "checkvariablenames": false, "vsetrange": [0, 1], "showpreview": true, "answer": "2*3^n", "checkingtype": "absdiff", "vsetrangepoints": 5}], "showCorrectAnswer": true, "type": "gapfill", "marks": 0, "scripts": {}, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "prompt": "A sequence $y(n)$ is defined by the recursive formula
\n$y(n) - 3y(n-1) = 0$ and $y(0)=2$.
\nFind a recurrence formula for $y(n)$:
\n$y(n)$ = [[0]]
"}], "ungrouped_variables": [], "preamble": {"js": "", "css": ""}, "functions": {}, "rulesets": {}, "type": "question"}]}], "metadata": {"description": "First- and second order recurrence equations, homogenous and nonhomogenous
", "licence": "Creative Commons Attribution 4.0 International"}, "navigation": {"allowregen": true, "reverse": true, "browse": true, "showresultspage": "oncompletion", "showfrontpage": true, "onleave": {"action": "none", "message": ""}, "preventleave": true}, "feedback": {"allowrevealanswer": true, "advicethreshold": 0, "intro": "", "showanswerstate": true, "showactualmark": true, "showtotalmark": true, "feedbackmessages": [], "enterreviewmodeimmediately": true, "showexpectedanswerswhen": "inreview", "showpartfeedbackmessageswhen": "always", "showactualmarkwhen": "always", "showtotalmarkwhen": "always", "showanswerstatewhen": "always", "showadvicewhen": "never"}, "percentPass": "50", "timing": {"timedwarning": {"action": "none", "message": ""}, "allowPause": true, "timeout": {"action": "none", "message": ""}}, "type": "exam", "contributors": [{"name": "Julie Crowley", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/113/"}, {"name": "Marie Nicholson", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/1799/"}], "extensions": [], "custom_part_types": [], "resources": []}