// Numbas version: exam_results_page_options {"name": "Computing terms in a recurrence relation 2", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "question_groups": [{"pickingStrategy": "all-ordered", "questions": [{"metadata": {"licence": "None specified", "description": ""}, "ungrouped_variables": ["a"], "parts": [{"showCorrectAnswer": true, "unitTests": [], "type": "gapfill", "prompt": "

C(1) = [[0]]

\n

C(2) = [[1]]

\n

C(3) = [[2]]

\n

C(4) = [[3]]

", "variableReplacementStrategy": "originalfirst", "sortAnswers": false, "gaps": [{"vsetRangePoints": 5, "checkVariableNames": false, "showCorrectAnswer": true, "unitTests": [], "checkingAccuracy": 0.001, "expectedVariableNames": [], "checkingType": "absdiff", "scripts": {}, "showPreview": true, "variableReplacementStrategy": "originalfirst", "failureRate": 1, "vsetRange": [0, 1], "showFeedbackIcon": true, "type": "jme", "variableReplacements": [], "extendBaseMarkingAlgorithm": true, "answer": "1", "marks": 1, "customMarkingAlgorithm": ""}, {"vsetRangePoints": 5, "checkVariableNames": false, "showCorrectAnswer": true, "unitTests": [], "checkingAccuracy": 0.001, "expectedVariableNames": [], "checkingType": "absdiff", "scripts": {}, "showPreview": true, "variableReplacementStrategy": "originalfirst", "failureRate": 1, "vsetRange": [0, 1], "showFeedbackIcon": true, "type": "jme", "variableReplacements": [], "extendBaseMarkingAlgorithm": true, "answer": "{a}", "marks": 1, "customMarkingAlgorithm": ""}, {"vsetRangePoints": 5, "checkVariableNames": false, "showCorrectAnswer": true, "unitTests": [], "checkingAccuracy": 0.001, "expectedVariableNames": [], "checkingType": "absdiff", "scripts": {}, "showPreview": true, "variableReplacementStrategy": "originalfirst", "failureRate": 1, "vsetRange": [0, 1], "showFeedbackIcon": true, "type": "jme", "variableReplacements": [], "extendBaseMarkingAlgorithm": true, "answer": "{a}^2", "marks": 1, "customMarkingAlgorithm": ""}, {"vsetRangePoints": 5, "checkVariableNames": false, "showCorrectAnswer": true, "unitTests": [], "checkingAccuracy": 0.001, "expectedVariableNames": [], "checkingType": "absdiff", "scripts": {}, "showPreview": true, "variableReplacementStrategy": "originalfirst", "failureRate": 1, "vsetRange": [0, 1], "showFeedbackIcon": true, "type": "jme", "variableReplacements": [], "extendBaseMarkingAlgorithm": true, "answer": "{a}^3", "marks": 1, "customMarkingAlgorithm": ""}], "showFeedbackIcon": true, "scripts": {}, "variableReplacements": [], "extendBaseMarkingAlgorithm": true, "marks": 0, "customMarkingAlgorithm": ""}], "name": "Computing terms in a recurrence relation 2", "rulesets": {}, "tags": [], "variables": {"a": {"group": "Ungrouped variables", "templateType": "anything", "description": "", "definition": "random(2..9)", "name": "a"}}, "advice": "", "extensions": [], "variablesTest": {"condition": "", "maxRuns": 100}, "preamble": {"js": "", "css": ""}, "variable_groups": [], "functions": {}, "statement": "

Consider the following recurrence relation:

\n

\n

\\[C(n)=\\begin{cases}1 & if & n=1\\\\ \\var{a}C(n-1) & if & n\\geq2 \\end{cases}\\]

\n

Compute the first four terms of this recurrence relation.

", "type": "question", "contributors": [{"name": "Marie Nicholson", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/1799/"}]}]}], "contributors": [{"name": "Marie Nicholson", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/1799/"}]}