// Numbas version: exam_results_page_options
{"question_groups": [{"pickQuestions": 1, "name": "Group", "pickingStrategy": "all-ordered", "questions": [{"name": "Simon's copy of Represent a linear map as a matrix with a given basis", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Newcastle University Mathematics and Statistics", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/697/"}, {"name": "Simon Thomas", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/3148/"}], "ungrouped_variables": ["a", "c", "b", "d", "f"], "variables": {"c": {"templateType": "anything", "group": "Ungrouped variables", "description": "", "definition": "random(-9..9)", "name": "c"}, "b": {"templateType": "anything", "group": "Ungrouped variables", "description": "", "definition": "random(1..9 except 0)", "name": "b"}, "a": {"templateType": "anything", "group": "Ungrouped variables", "description": "", "definition": "random(1..9 except 0)", "name": "a"}, "d": {"templateType": "anything", "group": "Ungrouped variables", "description": "", "definition": "random(-9..9 except 0)", "name": "d"}, "f": {"templateType": "anything", "group": "Ungrouped variables", "description": "", "definition": "random(-9..9 except 0)", "name": "f"}}, "preamble": {"js": "", "css": ""}, "statement": "<p>Let $P_n$ denote the vector space over the reals of polynomials $p(x)$ of degree $n$ &nbsp;with coefficients in the real numbers.</p>\n<p>Let the linear map \\[\\phi: P_4 \\rightarrow P_4 \\] be defined by:</p>\n<p>\\[\\phi(p(x)) = \\simplify[all,!collectnumbers]{{a} * p(x) + ({b} * x + {c}) * p'(x) + (x ^ 2 + {d} * x + {f}) * p''(x)}\\]</p>\n<p>where &nbsp;$p'(x)$ is the first derivative of $p(x)$ &nbsp;and $p''(x)$ the second derivative.&nbsp;</p>", "functions": {}, "metadata": {"description": "<p>Let $P_n$ denote the vector space over the reals of polynomials $p(x)$ of degree $n$ &nbsp;with coefficients in the real numbers.</p>\n                <p>Let the linear map $\\phi: P_4 \\rightarrow P_4$ be defined by:</p>\n                <p>$\\phi(p(x))=ap(x) + (bx + c)p'(x) + (x ^ 2 + dx + f)p''(x)$</p>\n                <p>Using the standard basis for range and domain find the matrix given by $\\phi$.</p>", "licence": "Creative Commons Attribution 4.0 International"}, "rulesets": {}, "variablesTest": {"maxRuns": 100, "condition": ""}, "parts": [{"gaps": [{"correctAnswerStyle": "plain", "minValue": "{a}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{a}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "{c}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{c}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "{2*f}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{2*f}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "0", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "0", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "{a+b}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{a+b}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "{2*d+2*c}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{2*d+2*c}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "{6*f}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{6*f}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "0", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "0", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "{a+2*b+2}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{a+2*b+2}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "{3*c+6*d}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{3*c+6*d}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "{12*f}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{12*f}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "0", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "0", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "{a+3*b+6}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{a+3*b+6}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "{4*c+12*d}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{4*c+12*d}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "0", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "0", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}, {"correctAnswerStyle": "plain", "minValue": "{a+4*b+12}", "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "mustBeReduced": false, "type": "numberentry", "notationStyles": ["plain", "en", "si-en"], "allowFractions": false, "maxValue": "{a+4*b+12}", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "correctAnswerFraction": false, "variableReplacements": [], "showFeedbackIcon": true, "mustBeReducedPC": 0, "showFractionHint": true, "marks": 0.5, "customName": "", "unitTests": []}], "sortAnswers": false, "scripts": {}, "showCorrectAnswer": true, "useCustomName": false, "customMarkingAlgorithm": "", "type": "gapfill", "extendBaseMarkingAlgorithm": true, "variableReplacementStrategy": "originalfirst", "variableReplacements": [], "showFeedbackIcon": true, "prompt": "Using the ordered basis $\\{1,\\;x,\\;x^2,\\;x^3,\\;x^4\\}$  of $P_4$ for both range and domain, $\\phi$  is represented by a 5 x 5 matrix.\n        \n        Fill in the entries for this matrix below: \n        <table>\n      <tbody>\n      <tr>\n      <td rowspan=\"5\">\\[\\left( \\begin{matrix}\\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\end{matrix} \\right.\\]</td>\n      <td>[[0]]</td>\n      <td>[[1]]</td>\n      <td>[[2]]</td>\n      <td>$0$</td>\n      <td>$0$</td>\n      <td rowspan=\"5\">\\[\\left) \\begin{matrix}\\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.} \\\\ \\phantom{.}\\\\ \\phantom{.}\\\\\\end{matrix} \\right.\\]</td>\n      </tr><tr>\n      <td>[[3]]</td>\n      <td>[[4]]</td>\n      <td>[[5]]</td>\n      <td>[[6]]</td>\n      <td>$0$</td>\n      </tr>\n      <tr>\n      <td>$0$</td>\n      <td>[[7]]</td>\n      <td>[[8]]</td>\n      <td>[[9]]</td>\n      <td>[[10]]</td>\n      </tr>\n      <tr>\n      <td>$0$</td>\n      <td>$0$</td>\n      <td>[[11]]</td>\n      <td>[[12]]</td>\n      <td>[[13]]</td>\n      </tr>\n      <tr>\n      <td>$0$</td>\n      <td>$0$</td>\n      <td>$0$</td>\n      <td>[[14]]</td>\n      <td>[[15]]</td>\n      </tr>\n      </tbody>\n      </table>", "marks": 0, "customName": "", "unitTests": []}], "variable_groups": [], "tags": [], "advice": "<p>We have:</p>\n<p>\\[\\phi(1) =\\simplify[]{ {a} * 1 + ({b} * x + {c}) * 0 + (x ^ 2 + {d} * x + {f}) * 0 = {a} = {a} * 1 + 0 * x + 0 * x ^ 2 + 0 * x ^ 3 + 0 * x ^ 4}\\]</p>\n<p>which gives the first column of the matrix.</p>\n<p></p>\n<p>\\[\\phi(x) = \\simplify[]{{a} * x + ({b} * x + {c}) * 1 + (x ^ 2 + {d} * x + {f}) * 0 = {c} + {a + b} * x = {c} * 1 + {a + b} * x + 0 * x ^ 2 + 0 * x ^ 3 + 0 * x ^ 4}\\]</p>\n<p>gives the second column of the matrix.</p>\n<p></p>\n<p>\\[\\phi(x ^ 2) = \\simplify[]{{a} * x ^ 2 + ({b} * x + {c}) * 2 * x + (x ^ 2 + {d} * x + {f}) * 2 = {2 * f} + {2 * d + 2 * c} * x + {a + 2 * b + 2} * x ^ 2 = {2 * f} * 1 + {2 * d + 2 * c} * x + {a + 2 * b + 2} * x ^ 2 + 0 * x ^ 3 + 0 * x ^ 4}\\]</p>\n<p>gives the third column of the matrix.</p>\n<p></p>\n<p>Continuing on in this way for $\\phi(x^3),\\;\\phi(x^4)$ we obtain the matrix for $\\phi$ with respect to the given bases for domain and range.</p>\n<p>\\[\\begin{pmatrix}\\var{a}&amp;\\var{c}&amp;\\var{2*f}&amp;0&amp;0\\\\0&amp;\\var{a+b}&amp;\\var{2*d+2*c}&amp;\\var{6*f}&amp;0\\\\0&amp;0&amp;\\var{a+2*b+2}&amp;\\var{3*c+6*d}&amp;\\var{12*f}\\\\0&amp;0&amp;0&amp;\\var{a+3*b+6}&amp;\\var{4*c+12*d}\\\\0&amp;0&amp;0&amp;0&amp;\\var{a+4*b+12}\\end{pmatrix}\\]</p>", "type": "question"}, {"name": "Simon's copy of Row reducing a matrix and finding its rank and nullity-MA2223", "extensions": ["stats"], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Newcastle University Mathematics and Statistics", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/697/"}, {"name": "Simon Thomas", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/3148/"}], "metadata": {"description": "<p>Reduce a 5x6 matrix to row reduced form and using this find&nbsp;rank and nullity.</p>", "licence": "Creative Commons Attribution 4.0 International"}, "variablesTest": {"condition": "deter<>0\nand\nmax(map(testing(record[0][x]),x,0..length(record[0])-1))=0", "maxRuns": "200"}, "preamble": {"css": "", "js": "question.functions={};\nquestion.functions.ref=function(m){\n  \n  m = util.copyarray(m,true);\n  \n  function finish() {\n\n    return rank;\n  }\n\n\n\n  var lead = 0;\n  var rank = 0;\n  var echelon=[];\n  var rows = m.length;\n  for(var i=0;i<rows;i++){echelon.push(0);}\n  var columns=m[0].length;\n  for (var r = 0; r < rows; r++) {\n    if (columns <= lead) {\n      return finish();\n    }\n    var i = r;\n    while (m[i][lead] == 0) {\n      i++;\n      if (rows == i) {\n\n        i = r;\n        lead++;\n        if (columns == lead) {\n          return finish();\n        }\n      }\n    }\n\n    var tmp = m[i];\n    m[i] = m[r];\n    m[r] = tmp;\n    echelon[r]=lead+1;\n    rank+=1;\n    //var val = m[r][lead];\n    //var inval;\n    //nval=1/val;\n\n    // divide this row by the leading value\n    /*\n        for (var j = 0; j < columns; j++) {\n            m[r][j] = m[r][j]*inval;\n        }\n      */\n\n    // for each row, find a linear combination of m[r] and m[i] so that m[i][lead] becomes 0\n    for (var i = 0; i < rows; i++) {\n      if (i == r) continue;\n      var v_i = m[i][lead];\n      if(v_i!=0) {\n        var v_r = m[r][lead];\n        var lcm = Numbas.math.lcm(Math.abs(v_i),Math.abs(v_r));\n        var a = lcm/Math.abs(v_i);\n        var b = -Numbas.math.sign(v_i*v_r)*lcm/Math.abs(v_r);\n        for (var j = 0; j < columns; j++) {\n          m[i][j] = a*m[i][j] + b*m[r][j];\n        }\n      }\n    }\n    lead++;\n  }\n  return finish();\n}\n\n"}, "tags": [], "variables": {"rows": {"definition": "6", "name": "rows", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "rref1": {"definition": "rref1(list(testmatrix))[0]", "name": "rref1", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "maxint": {"definition": "4", "name": "maxint", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "nullity": {"definition": "5-rank", "name": "nullity", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "sum": {"definition": "sum(echform)", "name": "sum", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "echelonform": {"definition": "echelon_form_matrix(rows,rank,columns,maxint)", "name": "echelonform", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "ec": {"definition": "echmatrix", "name": "ec", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "echmatrix": {"definition": "matrix(ech)", "name": "echmatrix", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "record_ops_matrix": {"definition": "record[0]", "name": "record_ops_matrix", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "columns": {"definition": "5", "name": "columns", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "ech": {"definition": "echelonform[0]", "name": "ech", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "rank": {"definition": "random(2,3,4)\n", "name": "rank", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "null_basis": {"definition": "switch(sum=6,[[ec[0][2]*ec[2][3]-ec[0][3],ec[1][2]*ec[2][3]-ec[1][3],-ec[2][3],1,0],\n    [ec[0][2]*ec[2][4]-ec[0][4],ec[1][2]*ec[2][4]-ec[1][4],-ec[2][4],0,1]],\n  sum=7,[[-ec[0][2],-ec[1][2],1,0,0],[-ec[0][4],-ec[1][4],0,-ec[2][4],1]],\n  (sum=8) and(5 in echform),[[-ec[0][2],-ec[1][2],1,0,0],[-ec[0][3],-ec[1][3],0,1,0]],\n  sum=8,[[-ec[0][1],1,0,0,0],[-ec[0][4],0,-ec[1][4],-ec[2][4],1]],\n  sum=9,[[-ec[0][1],1,0,0,0],[-ec[0][3],0,-ec[1][3],1,0]],\n  [[-ec[0][1],1,0,0,0],[-ec[0][2],0,1,0,0]])", "name": "null_basis", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "testmatrix": {"definition": "matrix(rdmat)*matrix(ech)", "name": "testmatrix", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "record": {"definition": "rref(list(testmatrix),0)", "name": "record", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "chosen": {"definition": "[true,true,false,true,false]", "name": "chosen", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "deter": {"definition": "rref(rdmat,0)[3]", "name": "deter", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "record_ops_message": {"definition": "record[1]", "name": "record_ops_message", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "student_cols_matrix": {"definition": "transpose(matrix(map(transpose(echmatrix)[n],n,filter(chosen[j],j,0..4))))", "name": "student_cols_matrix", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "echform": {"definition": "map(x+1,x,echelonform[1])", "name": "echform", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "trtestmatrix": {"definition": "transpose(testmatrix)", "name": "trtestmatrix", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "column_basis": {"definition": "set(map(trtestmatrix[x],x,echelonform[1]))", "name": "column_basis", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "not_chosen_col": {"definition": "transpose(matrix(map(transpose(echmatrix)[n],n,filter(!chosen[j],j,0..4)))[0])", "name": "not_chosen_col", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "steps": {"definition": "rref(list(testmatrix),0)[2]", "name": "steps", "description": "", "group": "Ungrouped variables", "templateType": "anything"}, "rdmat": {"definition": "rdmat(rows)", "name": "rdmat", "description": "", "group": "Ungrouped variables", "templateType": "anything"}}, "functions": {"rref1": {"parameters": [["m", "list"]], "definition": "function finish() {\n  for(var i=0;i<rows;i++) {\n    var leader = null;\n    for(var j=0;j<columns;j++) {\n      if(leader!==null) {\n        m[i][j] /= leader;\n      } else if(m[i][j]!=0) {\n        leader = m[i][j];\n        m[i][j] = 1;\n      }\n    }\n  }\n  return [m,echelon,rank];\n}\n\n//This question used the function rref(m) defined in Functions & Rulesets to find the row reduced echelon form of a matrix m.\n\n//rref(m)[0] is the row reduced matrix, rref(m)[1] the echelon form.\n\n    var lead = 0;\n    var rank=0;\n    var echelon=[];\n    var rows = m.length;\n    for(var i=0;i<rows;i++){echelon.push(0);}\n    var columns=m[0].length;\n    for (var r = 0; r < rows; r++) {\n        if (columns <= lead) {\n            return finish();\n        }\n        var i = r;\n        while (m[i][lead] == 0) {\n            i++;\n            if (rows == i) {\n              \n                i = r;\n                lead++;\n                if (columns == lead) {\n                    return finish();\n                }\n            }\n        }\n \n        var tmp = m[i];\n        m[i] = m[r];\n        m[r] = tmp;\n        echelon[r]=lead+1;\n        rank+=1;\n        //var val = m[r][lead];\n        //var inval;\n        //nval=1/val;\n\n        // divide this row by the leading value\n      /*\n        for (var j = 0; j < columns; j++) {\n            m[r][j] = m[r][j]*inval;\n        }\n      */\n \n      // for each row, find a linear combination of m[r] and m[i] so that m[i][lead] becomes 0\n       for (var i = 0; i < rows; i++) {\n         if (i == r) continue;\n         var v_i = m[i][lead];\n         if(v_i!=0) {\n           var v_r = m[r][lead];\n           var lcm = Numbas.math.lcm(Math.abs(v_i),Math.abs(v_r));\n           var a = lcm/Math.abs(v_i);\n           var b = -Numbas.math.sign(v_i*v_r)*lcm/Math.abs(v_r);\n           for (var j = 0; j < columns; j++) {\n             m[i][j] = a*m[i][j] + b*m[r][j];\n           }\n         }\n        }\n        lead++;\n    }\n    return finish();\n", "type": "list", "language": "javascript"}, "testing": {"parameters": [["m", "list"]], "definition": "\nvar check=0;\nhere:\nfor(var i=0;i<m.length;i++){\n  for(var j=0;j<m[0].length;j++)\n  {if(Math.round(m[i][j])!=m[i][j]) {check= 1;break here;}\n  }\n}\nreturn check;\n      ", "type": "number", "language": "javascript"}, "solution": {"parameters": [["matrix_list", "list"], ["message_list", "list"]], "definition": "function st(o){\n  return '['+o.toString()+']';\n}\nfunction display_format(mat){\nvar s= st(mat.map(st));\n  return '$\\\\simplify[fractionNumbers]{{matrix('+s+')}}$';\n}\nvar table = $('<table>');\nvar n=matrix_list.length;\nvar m='';\nvar mess='';\nfor(var i=0;i<n;i++){\nm=display_format(matrix_list[i]);\nmess= message_list[i];\ntable.append('<tr><td style=\"text-align:left;\">'+mess+'</td></tr>');\ntable.append('<tr><td style=\"text-align:left;\"></td></tr>');\ntable.append('<tr><td style=\"text-align:left;\">'+m+'</td></tr>');  \n}\nreturn table;\n", "type": "html", "language": "javascript"}, "echelon_form_matrix": {"parameters": [["n", "number"], ["r", "number"], ["m", "number"], ["max", "number"]], "definition": "\nfunction getRandomInt(min, max) {\n  return Math.floor(Math.random() * (max - min + 1)) + min;\n};\n//generate a random echelon form\nfunction random_echelon_form(columns,rank){\nvar l=[];\nvar ech_form=[], ech_form1=[],b=[];\nfor(var i=1;i<columns;i++) {l.push(i);}\nech_form1=Numbas.math.shuffle(l);\nech_form1.splice(0,0,0);\nech_form=ech_form1.slice(0,rank);\nb=ech_form.sort(function(x,y){return x-y;});\nreturn b;\n}\n\n\n\nvar c=random_echelon_form(m,r);\n\nvar ind;\nvar temp;\nvar ech_matrix=[];\nfor(var i=0;i<r;i++){\n  ind=c[i];\n  temp=[];\n  for(var j=0;j<m;j++){\n    j>=ind?temp.push(getRandomInt(1,max)):temp.push(0);\n  }\n  for(var k=0;k<r;k++){temp.splice(c[k],1,0);}\n  temp.splice(ind,1,1);\n\n  ech_matrix.push(temp);\n}\nfor(var i1=r;i1<n;i1++){\n var tempz=[];\n\n for(j=0;j<m;j++){tempz.push(0);} \n ech_matrix.push(tempz);\n}\n\n\nreturn [ech_matrix,c];\n\n\n\n\n\n", "type": "list", "language": "javascript"}, "rref": {"parameters": [["a", "list"], ["p", "number"]], "definition": "\nfunction findinv(a,q){\n  var s=0;\n  for(var j=1;j<q;j++){\n    if(modulo(a*j,q)==1){s=j;}\n  }\n  return s;\n}\nfunction copy_matrix(m){\n  return Numbas.util.copyarray(m,true);\n}\nfunction modulo(n,r){\n  if(r==0){return n;} else {return (r+n%r)%r;}\n}\n    var m=copy_matrix(a);\n    var lead = 0;\n    var echelon=[];\n    var deter=1;\n    var rows = m.length;\n    for(var i=0;i<rows;i++){echelon.push(0);}\n    var rank=rows;\n    var steps = 0;\n    var record_ops_matrix=[a];\n    var record_ops_message=['Starting with the matrix.'];\n    var columns=m[0].length;\n    for (var r = 0; r < rows; r++) {\n        if (columns <= lead) {\n          \n          record_ops_matrix.push(copy_matrix(m));\n          record_ops_message.push('Finished!');\n          return [record_ops_matrix, record_ops_message,steps,deter];\n        }\n        var i = r;\n        while (modulo(m[i][lead],p) == 0) {\n            i++;\n            if (rows == i) {\n                deter=0;\n                i = r;\n                rank-=1;\n                lead++;\n                if (columns == lead) {\n                    steps+=1;\n                    record_ops_matrix.push(copy_matrix(m));\n                    record_ops_message.push('Finished!');\n               return [record_ops_matrix, record_ops_message,steps,deter];\n                }\n            }\n        }\n \n        var tmp = m[i];\n        m[i] = m[r];\n        m[r] = tmp;\n        echelon[r]=lead+1;\n        var val = modulo(m[r][lead],p);\n        var inval;\n      if(p==0){inval=1/val;} else {inval=findinv(val,p);}\n      //if we have switched the ith and rth row i.e. a transposition, we have to multiply by -1\n      deter=(i==r?1:-1)*val*deter;  \n      for (var j = 0; j < columns; j++) {\n            m[r][j] = modulo(m[r][j]*inval,p);\n        }\n                    steps+=1;\n      var sw='';\n      var tw='';\n      if(val!=1){tw='We have divided throughout row '+(r+1)+' by $\\\\simplify[fractionNumbers]{{'+val+'}}$ so that the leading entry is 1.';}\n      if(i!=r)\n      {sw='We switch rows '+(r+1)+' and '+(i+1)+'.';\n      }\n      if(val!=1||i!=r){record_ops_matrix.push(copy_matrix(m));\n                 record_ops_message.push(sw+tw);}\n      \n        for (var i = 0; i < rows; i++) {\n            if (i == r) continue;\n            val = modulo(m[i][lead],p);\n            for (var j = 0; j < columns; j++) {\n                m[i][j] = modulo(m[i][j]-val * m[r][j],p);\n            }\n        }\n                    steps+=1;\n\n                    record_ops_matrix.push(copy_matrix(m));\n                    record_ops_message.push('We have reduced every other entry in column '+ (lead+1)+' to zero by adding suitable multiples of row '+(r+1)+ ' to the other rows.');\n      \n        lead++;\n    }\n          steps+=1;          \n          record_ops_matrix.push(copy_matrix(m));\n          record_ops_message.push('Finished!');\n          return [record_ops_matrix, record_ops_message,steps,deter];\n", "type": "list", "language": "javascript"}, "rdmat": {"parameters": [["n", "number"]], "definition": "function getRandomInt(min, max) {\nreturn Math.floor(Math.random() * (max - min + 1)) + min;\n};\nvar m=[];\nvar temp;\nfor(var i=0;i<n;i++){\n  temp=[];\n  for(var j=0;j<n;j++)\n  {temp.push(getRandomInt(-3,3));\n  }\n  m.push(temp);\n}\nm[0][0]=1;\nreturn m;", "type": "list", "language": "javascript"}}, "rulesets": {}, "advice": "<p><strong>(a)</strong></p>\n<p>The following shows how $A$ is reduced to row-echelon form.</p>\n<p></p>\n<p>{solution(record_ops_matrix,record_ops_message)}</p>\n<p><strong></strong></p>\n<p><strong>(b)&nbsp;</strong></p>\n<p>Once a matrix is in reduced row echelon form, we can find the rank simply by counting the number of nonzero rows. This is also the same as the number of leading 1s.</p>\n<p>Thus in our example&nbsp;$Rank(A)=\\var{rank}$.</p>\n<p>Remember that the Rank-Nullity Theorem says that:</p>\n<p>Number of Columns of $A = Rank(A) + Nullity(A)$</p>\n<p></p>\n<p>Hence $Nullity(A) = $ number of columns $-Rank(A)=5-\\var{rank}=\\var{nullity}$.</p>\n<p></p>\n<p>Also the dimensions of the row space and the column space are both equal to the rank.</p>\n<p>Finally, the dimension of the null space is the nullity.</p>\n<p></p>", "parts": [{"variableReplacements": [], "type": "gapfill", "extendBaseMarkingAlgorithm": true, "scripts": {}, "showFeedbackIcon": true, "showCorrectAnswer": true, "customMarkingAlgorithm": "", "gaps": [{"variableReplacements": [], "allowFractions": true, "type": "matrix", "extendBaseMarkingAlgorithm": true, "allowResize": false, "scripts": {}, "correctAnswer": "{echmatrix}", "showFeedbackIcon": true, "showCorrectAnswer": true, "customMarkingAlgorithm": "", "tolerance": 0, "variableReplacementStrategy": "originalfirst", "markPerCell": false, "useCustomName": false, "customName": "", "numColumns": "5", "correctAnswerFractions": true, "numRows": "6", "marks": "4", "unitTests": []}], "prompt": "<p></p>\n<p>$R= $[[0]]</p>\n<p><strong>All entries in the matrix must be input as fractions or integers and not as decimals.</strong></p>\n<p></p>\n<p></p>", "variableReplacementStrategy": "originalfirst", "sortAnswers": false, "useCustomName": false, "customName": "", "marks": 0, "unitTests": []}, {"variableReplacements": [], "type": "gapfill", "extendBaseMarkingAlgorithm": true, "scripts": {}, "showFeedbackIcon": true, "showCorrectAnswer": true, "customMarkingAlgorithm": "", "gaps": [{"variableReplacements": [], "maxValue": "rank", "type": "numberentry", "extendBaseMarkingAlgorithm": true, "scripts": {}, "allowFractions": false, "showFeedbackIcon": true, "showCorrectAnswer": true, "customMarkingAlgorithm": "", "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "variableReplacementStrategy": "originalfirst", "showFractionHint": true, "correctAnswerFraction": false, "useCustomName": false, "customName": "", "mustBeReduced": false, "minValue": "rank", "mustBeReducedPC": 0, "marks": "0.2", "unitTests": []}, {"variableReplacements": [], "maxValue": "nullity", "type": "numberentry", "extendBaseMarkingAlgorithm": true, "scripts": {}, "allowFractions": false, "showFeedbackIcon": true, "showCorrectAnswer": true, "customMarkingAlgorithm": "", "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "variableReplacementStrategy": "originalfirst", "showFractionHint": true, "correctAnswerFraction": false, "useCustomName": false, "customName": "", "mustBeReduced": false, "minValue": "nullity", "mustBeReducedPC": 0, "marks": "0.2", "unitTests": []}, {"variableReplacements": [], "maxValue": "rank", "type": "numberentry", "extendBaseMarkingAlgorithm": true, "scripts": {}, "allowFractions": false, "showFeedbackIcon": true, "showCorrectAnswer": true, "customMarkingAlgorithm": "", "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "variableReplacementStrategy": "originalfirst", "showFractionHint": true, "correctAnswerFraction": false, "useCustomName": false, "customName": "", "mustBeReduced": false, "minValue": "rank", "mustBeReducedPC": 0, "marks": "0.2", "unitTests": []}, {"variableReplacements": [], "maxValue": "rank", "type": "numberentry", "extendBaseMarkingAlgorithm": true, "scripts": {}, "allowFractions": false, "showFeedbackIcon": true, "showCorrectAnswer": true, "customMarkingAlgorithm": "", "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "variableReplacementStrategy": "originalfirst", "showFractionHint": true, "correctAnswerFraction": false, "useCustomName": false, "customName": "", "mustBeReduced": false, "minValue": "rank", "mustBeReducedPC": 0, "marks": "0.2", "unitTests": []}, {"variableReplacements": [], "maxValue": "nullity", "type": "numberentry", "extendBaseMarkingAlgorithm": true, "scripts": {}, "allowFractions": false, "showFeedbackIcon": true, "showCorrectAnswer": true, "customMarkingAlgorithm": "", "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "variableReplacementStrategy": "originalfirst", "showFractionHint": true, "correctAnswerFraction": false, "useCustomName": false, "customName": "", "mustBeReduced": false, "minValue": "nullity", "mustBeReducedPC": 0, "marks": "0.2", "unitTests": []}], "prompt": "<p></p>\n<p>$\\operatorname{Rank}(A)=$[[0]]</p>\n<p>$\\operatorname{Nullity}(A)=$[[1]]</p>\n<p>$\\operatorname{dim}(\\operatorname{col}(A))=$[[2]]</p>\n<p>$\\operatorname{dim}(\\operatorname{row}(A))=$[[3]]</p>\n<p>$\\operatorname{dim}(\\operatorname{null}(A))=$[[4]]</p>\n<p></p>", "variableReplacementStrategy": "originalfirst", "sortAnswers": false, "useCustomName": false, "customName": "", "marks": 0, "unitTests": []}], "statement": "<p>Find the row-reduced echelon form $R$ of the following matrix $A$.</p>\n<p>$A=\\var{testmatrix}$</p>\n<p></p>\n<p><span id=\"type\"></span></p>", "variable_groups": [], "ungrouped_variables": ["echelonform", "ech", "echform", "testmatrix", "record", "rref1", "record_ops_matrix", "record_ops_message", "rank", "maxint", "steps", "rdmat", "deter", "nullity", "echmatrix", "trtestmatrix", "rows", "columns", "column_basis", "sum", "null_basis", "ec", "chosen", "student_cols_matrix", "not_chosen_col"], "type": "question"}, {"name": "Simon's copy of Represent a linear map as a matrix given a basis", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Newcastle University Mathematics and Statistics", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/697/"}, {"name": "Simon Thomas", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/3148/"}], "variablesTest": {"maxRuns": 100, "condition": ""}, "ungrouped_variables": ["a", "c", "b"], "statement": "<p>Let $P_n$ denote the vector space over the reals of polynomials $p(x)$ of degree $n$ &nbsp;with coefficients in the real numbers.</p>\n  <p>Let the linear map $\\phi: P_4 \\rightarrow P_4$ be defined by:</p>\n  <p>\\[\\phi(p(x))=p(\\var{a})+p(\\simplify{{b}x+{c}})\\]</p>\n  <p>This is given by evaluating $p(x)$ at $x=\\var{a}$ and adding this to the polynomial given by replacing $x$ by $\\simplify{{b}x+{c}}$ in $p(x)$.</p>\n  <p>For example:</p>\n  <p>$\\phi(x^2+2x)=\\simplify[all,!collectnumbers,!noleadingminus]{{a}^2+2*{a}+({b}x+{c})^2+2*({b}x+{c})={a^2+2*a+2*c}+{2*b*c+2*b}*x+{b^2}*x^2}$.</p>\n  <p>Using the standard basis for range and domain find the matrix given by $\\phi$.</p>", "parts": [{"type": "gapfill", "variableReplacementStrategy": "originalfirst", "useCustomName": false, "prompt": "<p>Using the ordered basis $\\{1,\\;x,\\;x^2,\\;x^3,\\;x^4\\}$ of $P_4$ for both range and domain, $\\phi$ is represented by a 5 x 5 matrix. Fill in the entries for this matrix below:</p>\n        <table>\n        <tbody>\n        <tr>\n        <td rowspan=\"5\">\\[\\left( \\begin{matrix}\\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\end{matrix} \\right.\\]</td>\n        <td>[[0]]</td>\n        <td>[[1]]</td>\n        <td>[[2]]</td>\n        <td>[[3]]</td>\n        <td>[[4]]</td>\n        <td rowspan=\"5\">\\[\\left) \\begin{matrix}\\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.}\\\\ \\phantom{.} \\\\ \\phantom{.}\\\\ \\phantom{.}\\\\\\end{matrix} \\right.\\]</td>\n        </tr>\n        <tr>\n        <td>$0$</td>\n        <td>[[5]]</td>\n        <td>[[6]]</td>\n        <td>[[7]]</td>\n        <td>[[8]]</td>\n        </tr>\n        <tr>\n        <td>$0$</td>\n        <td>$0$</td>\n        <td>[[9]]</td>\n        <td>[[10]]</td>\n        <td>[[11]]</td>\n        </tr>\n        <tr>\n        <td>$0$</td>\n        <td>$0$</td>\n        <td>$0$</td>\n        <td>[[12]]</td>\n        <td>[[13]]</td>\n        </tr>\n        <tr>\n        <td>$0$</td>\n        <td>$0$</td>\n        <td>$0$</td>\n        <td>$0$</td>\n        <td>[[14]]</td>\n        </tr>\n        </tbody>\n        </table>", "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "sortAnswers": false, "marks": 0, "unitTests": [], "gaps": [{"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "2", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "2", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{a+c}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{a+c}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{a^2+c^2}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{a^2+c^2}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{a^3+c^3}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{a^3+c^3}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{a^4+c^4}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{a^4+c^4}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{b}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{b}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{2*b*c}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{2*b*c}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{3*b*c^2}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{3*b*c^2}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{4*b*c^3}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{4*b*c^3}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{b^2}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{b^2}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{3*b^2*c}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{3*b^2*c}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{6*b^2*c^2}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{6*b^2*c^2}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{b^3}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{b^3}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{4*b^3*c}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{4*b^3*c}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}, {"type": "numberentry", "variableReplacementStrategy": "originalfirst", "maxValue": "{b^4}", "useCustomName": false, "showFractionHint": true, "extendBaseMarkingAlgorithm": true, "customName": "", "customMarkingAlgorithm": "", "allowFractions": false, "minValue": "{b^4}", "mustBeReduced": false, "mustBeReducedPC": 0, "marks": 0.6, "unitTests": [], "correctAnswerFraction": false, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain", "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}], "scripts": {}, "showCorrectAnswer": true, "variableReplacements": [], "showFeedbackIcon": true}], "rulesets": {}, "metadata": {"licence": "Creative Commons Attribution 4.0 International", "description": "<p>Let $P_n$ denote the vector space over the reals of polynomials $p(x)$ of degree $n$ &nbsp;with coefficients in the real numbers. Let the linear map $\\phi: P_4 \\rightarrow P_4$ be defined by: \\[\\phi(p(x))=p(a)+p(bx+c).\\]Using the standard basis for range and domain find the matrix given by $\\phi$.</p>"}, "tags": [], "functions": {}, "advice": "<p>We have:</p>\n<p>\\[\\phi(1)=\\simplify[]{1+1= 2*1= 2 * 1 + 0 * x + 0 * x ^ 2 + 0 * x ^ 3 + 0 * x ^ 4}\\]</p>\n<p>gives the first column of the matrix.</p>\n<p>\\[\\phi(x)=\\simplify[]{{a}+ ({b} * x + {c}) = {a+c} + {b} * x = {a+c} * 1 + {b} * x + 0 * x ^ 2 + 0 * x ^ 3 + 0 * x ^ 4}\\]</p>\n<p>gives the second column of the matrix.</p>\n<p>\\[\\phi(x^2)=\\simplify[]{ {a}^ 2 + ({b} * x + {c})^2 = {a^2+c^2} + {2 * b* c} * x + {b^2} * x ^ 2 = {a^2+c^2} * 1 + {2*b*c} * x + {b^2} * x ^ 2 + 0 * x ^ 3 + 0 * x ^ 4}\\]</p>\n<p>&nbsp;gives the third column of the matrix.</p>\n<p></p>\n<p>Continuing on in this way for $\\phi(x^3),\\;\\phi(x^4)$:</p>\n<p>\\[\\phi(x^3)=\\simplify[]{ {a}^ 3 + ({b} * x + {c})^3}= ... \\]</p>\n<p>\\[\\phi(x^4)=\\simplify[]{ {a}^ 4 + ({b} * x + {c})^4}= ... \\]</p>\n<p>we obtain the matrix for $\\phi$ with respect to the given bases for domain and range.</p>\n<p>&nbsp;</p>\n<p>\\[\\begin{pmatrix}\\var{2}&amp;\\var{a+c}&amp;\\var{a^2+c^2}&amp;\\var{a^3+c^3}&amp;\\var{a^4+c^4}\\\\0&amp;\\var{b}&amp;\\var{2*b*c}&amp;\\var{3*b*c^2}&amp;\\var{4*b*c^3}\\\\0&amp;0&amp;\\var{b^2}&amp;\\var{3*b^2*c}&amp;\\var{6*b^2*c^2}\\\\0&amp;0&amp;0&amp;\\var{b^3}&amp;\\var{4*b^3*c}\\\\0&amp;0&amp;0&amp;0&amp;\\var{b^4}\\end{pmatrix}\\]</p>", "preamble": {"js": "", "css": ""}, "variable_groups": [], "variables": {"c": {"name": "c", "definition": "random(-5..5 except 0)", "group": "Ungrouped variables", "description": "", "templateType": "anything"}, "a": {"name": "a", "definition": "random(-5..5 except 0)", "group": "Ungrouped variables", "description": "", "templateType": "anything"}, "b": {"name": "b", "definition": "random(1..5)", "group": "Ungrouped variables", "description": "", "templateType": "anything"}}, "type": "question"}, {"name": "Solve a separable first order ODE, ", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Newcastle University Mathematics and Statistics", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/697/"}], "variable_groups": [], "variables": {"b1": {"group": "Ungrouped variables", "templateType": "anything", "definition": "random(1..9)*sign(random(-1,1))", "description": "", "name": "b1"}, "c1": {"group": "Ungrouped variables", "templateType": "anything", "definition": "random(1..9)*sign(random(-1,1))", "description": "", "name": "c1"}, "a1": {"group": "Ungrouped variables", "templateType": "anything", "definition": "random(1..9)*sign(random(-1,1))", "description": "", "name": "a1"}, "d1": {"group": "Ungrouped variables", "templateType": "anything", "definition": "random(1..9)*sign(random(-1,1))", "description": "", "name": "d1"}}, "ungrouped_variables": ["a1", "c1", "b1", "d1"], "question_groups": [{"pickingStrategy": "all-ordered", "questions": [], "name": "", "pickQuestions": 0}], "functions": {}, "showQuestionGroupNames": false, "parts": [{"showCorrectAnswer": true, "scripts": {}, "gaps": [{"answer": "{-a1}", "showCorrectAnswer": true, "vsetrange": [0, 1], "scripts": {}, "checkvariablenames": false, "expectedvariablenames": [], "notallowed": {"message": "<p>Do not enter decimals in your answer.</p>", "showStrings": false, "partialCredit": 0, "strings": ["."]}, "showpreview": true, "checkingtype": "absdiff", "checkingaccuracy": 0.001, "answersimplification": "all", "type": "jme", "variableReplacementStrategy": "originalfirst", "variableReplacements": [], "marks": 1, "vsetrangepoints": 5}, {"answer": "x^2+{2*b1}*x+{(a1+d1)^2-c1^2-2*b1*c1}", "showCorrectAnswer": true, "vsetrange": [0, 1], "checkingaccuracy": 0.001, "checkvariablenames": false, "expectedvariablenames": [], "notallowed": {"message": "<p>Do not enter decimals in your answer, and expand $f(x)$ fully, so that no parentheses appear in the expression.</p>", "showStrings": true, "partialCredit": 0, "strings": [".", "(", ")"]}, "showpreview": true, "checkingtype": "absdiff", "scripts": {}, "type": "jme", "variableReplacementStrategy": "originalfirst", "variableReplacements": [], "marks": 1, "vsetrangepoints": 5}], "type": "gapfill", "variableReplacementStrategy": "originalfirst", "prompt": "<p>Solve the equation, and enter the value of $\\alpha$ and the expression for $f(x)$ in the boxes. &nbsp;Do not enter decimals in your answers.</p>\n      <p>$\\alpha=$ [[0]].</p>\n      <p>$f(x)=$ [[1]]. &nbsp;(Expand $f(x)$ fully, so that no parentheses appear in the expression.)</p>", "variableReplacements": [], "marks": 0}], "statement": "<p>You are given the differential equation</p>\n    <p>\\[(\\var{a1}+y)y'=\\var{b1}+x,\\]</p>\n    <p>satisfying $y(\\var{c1})=\\var{d1}$.</p>\n    <p>The solution can be written in the form $y=\\alpha\\pm\\sqrt{f(x)}$, where $\\alpha$ is a constant, and $f(x)$ is some function of $x$.</p>", "tags": ["checked2015", "MAS1603", "MAS2105"], "rulesets": {"std": ["all", "!collectNumbers", "!noLeadingMinus"]}, "preamble": {"css": "", "js": ""}, "type": "question", "metadata": {"notes": "<p><strong>Jan 2016 (WHF)</strong></p>\n<p>The bddy condition determines the solution, so not correct to have $\\pm$ in the solution.</p>", "licence": "Creative Commons Attribution 4.0 International", "description": "<p>Find the solution of a first order separable differential equation of the form $(a+y)y'=b+x$.</p>"}, "variablesTest": {"condition": "", "maxRuns": 100}, "advice": "<p>The differential equation is separable, and can be immediately integrated to give</p>\n  <p>\\[\\simplify{{a1}*y+(1/2)*y^2}=\\simplify{{b1}*x+(1/2)*x^2+c},\\]</p>\n  <p>or</p>\n  <p>\\[\\simplify{(1/2)*(y+{a1})^2-{a1^2}/2}=\\simplify{{b1}*x+(1/2)*x^2+c},\\]</p>\n  <p>then the general solution of the equation is</p>\n  <p>\\[y=\\var{-a1}\\pm\\simplify{sqrt(x^2+{2*b1}*x+2c+{a1^2})}\\]</p>\n  <p>or, upon redefining the constant $c$,</p>\n  <p>\\[y=\\var{-a1}\\pm\\simplify{sqrt(x^2+{2*b1}*x+c)}.\\]</p>\n  <p>Then we have</p>\n  <p>\\[\\var{d1}=y(\\var{c1})=\\var{-a1}\\pm\\simplify[std]{sqrt({c1}^2+{2*b1}*{c1}+c)}=\\var{-a1}\\pm\\simplify{sqrt({c1^2+2*b1*c1}+c)},\\]</p>\n  <p>so</p>\n  <p>\\[c=\\simplify[std]{({a1}+{d1})^2-{c1^2+2*b1*c1}}=\\simplify{{(a1+d1)^2-c1^2-2*b1*c1}}.\\]</p>\n  <p>Then the full solution is</p>\n  <p>\\[y=\\var{-a1}\\pm\\simplify{sqrt(x^2+{2*b1}*x+{(a1+d1)^2-c1^2-2*b1*c1})}.\\]</p>"}, {"name": "Find a basis for the row space of a matrix", "extensions": ["codewords", "permutations"], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Christian Lawson-Perfect", "profile_url": "https://numbas-editor.mas.ncl.ac.uk/accounts/profile/3/"}, {"name": "Christian Lawson-Perfect", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/7/"}], "variable_groups": [], "variables": {"codeword_matrix": {"templateType": "anything", "group": "Ungrouped variables", "definition": "map(\n  matrix(map(x[0..word_length[j]],x,shown_words[j])),\n  j,\n  0..num_parts-1\n)", "name": "codeword_matrix", "description": ""}, "word_length": {"templateType": "anything", "group": "Ungrouped variables", "definition": "repeat(random(4..6),num_parts)", "name": "word_length", "description": ""}, "generating_set": {"templateType": "anything", "group": "Ungrouped variables", "definition": "map(shuffle(allwords(word_length[j],field_size[j]))[0..random(3..4)],j,0..num_parts-1)", "name": "generating_set", "description": ""}, "shown_words": {"templateType": "anything", "group": "Ungrouped variables", "definition": "map(shuffle(span[j] except zero(word_length[j],field_size[j]))[0..random(3..4)],j,0..num_parts-1)", "name": "shown_words", "description": ""}, "num_parts": {"templateType": "anything", "group": "Ungrouped variables", "definition": "2", "name": "num_parts", "description": ""}, "field_size": {"templateType": "anything", "group": "Ungrouped variables", "definition": "repeat(random(2,3,5),num_parts)", "name": "field_size", "description": ""}, "rref": {"templateType": "anything", "group": "Ungrouped variables", "definition": "map(reduced_row_echelon_form(x),x,shown_words)", "name": "rref", "description": ""}, "basis": {"templateType": "anything", "group": "Ungrouped variables", "definition": "map(rref[j] except zero(word_length[j],field_size[j]),j,0..num_parts-1)", "name": "basis", "description": ""}, "span": {"templateType": "anything", "group": "Ungrouped variables", "definition": "map(set_generated_by(x),x,generating_set)", "name": "span", "description": ""}, "rref_matrix": {"templateType": "anything", "group": "Ungrouped variables", "definition": "map(\n  matrix(map(x[0..word_length[j]],x,rref[j])),\n  j,\n  0..num_parts-1\n)", "name": "rref_matrix", "description": ""}}, "ungrouped_variables": ["num_parts", "field_size", "word_length", "generating_set", "span", "shown_words", "codeword_matrix", "rref", "rref_matrix", "basis"], "functions": {}, "preamble": {"css": "", "js": "question.mark_basis = function(part,field_size,shown_words) {\n  with(Numbas.extensions.codewords) {\n    // check input is valid and parse as a list of words\n    mark_codeword_set(part,field_size,function(words) {\n      // answer is valid\n      this.answered = true;\n      \n      // check words given are linearly independent\n      if(!linearly_independent(words)) {\n        this.setCredit(0,\"The set of vectors you gave is not linearly independent.\");\n        return;\n      }\n      \n      // check that all of the shown words are in the set generated by the student's basis\n      var span = new Code(set_generated_by(words));\n      var not_generated = []\n      shown_words.map(function(word) {\n        if(!span.contains(word)) {\n          not_generated.push(word);\n        }\n      });\n      \n      // if any words aren't generated by the basis, no marks\n      if(not_generated.length) {\n        this.setCredit(0,\"Your basis does not generate every row of the given matrix.\");\n        return;\n      }\n      \n      // otherwise, student's basis is correct!\n      this.setCredit(1,\"Your answer is correct.\");\n    });\n  }\n}"}, "parts": [{"customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "prompt": "<p>$\\var{matrix(map(x[0..word_length[0]],x,shown_words[0]))}$ in $\\mathbb{Z}_{\\var{field_size[0]}}$.</p>\n<p>[[0]]</p>", "unitTests": [], "showFeedbackIcon": true, "scripts": {}, "gaps": [{"answer": "", "displayAnswer": "{join(map(string(x),x,basis[0]),',')}", "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "unitTests": [], "matchMode": "regex", "showFeedbackIcon": true, "scripts": {"mark": {"script": "question.mark_basis(this,variables.field_size[0],variables.shown_words[0]);", "order": "instead"}, "validate": {"script": "return Numbas.extensions.codewords.validate_codeword_set(this);", "order": "instead"}}, "type": "patternmatch", "variableReplacementStrategy": "originalfirst", "showCorrectAnswer": true, "variableReplacements": [], "marks": "2"}], "type": "gapfill", "variableReplacementStrategy": "originalfirst", "showCorrectAnswer": true, "variableReplacements": [], "marks": 0, "sortAnswers": false}, {"customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "prompt": "<p><span>$\\var{matrix(map(x[0..word_length[1]],x,shown_words[1]))}$ in $\\mathbb{Z}_{\\var{field_size[1]}}$.</span></p>\n<p>[[0]]</p>", "unitTests": [], "showFeedbackIcon": true, "scripts": {}, "gaps": [{"answer": "", "displayAnswer": "{join(map(string(x),x,basis[1]),',')}", "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "unitTests": [], "matchMode": "regex", "showFeedbackIcon": true, "scripts": {"mark": {"script": "question.mark_basis(this,variables.field_size[1],variables.shown_words[1]);", "order": "instead"}, "validate": {"script": "return Numbas.extensions.codewords.validate_codeword_set(this);", "order": "instead"}}, "type": "patternmatch", "variableReplacementStrategy": "originalfirst", "showCorrectAnswer": true, "variableReplacements": [], "marks": "2"}], "type": "gapfill", "variableReplacementStrategy": "originalfirst", "showCorrectAnswer": true, "variableReplacements": [], "marks": 0, "sortAnswers": false}], "statement": "<p>Find bases for the row spaces of the following matrices.</p>\n<p>Enter&nbsp;each answer as a list of vectors&nbsp;separated by commas.</p>", "tags": [], "rulesets": {}, "type": "question", "metadata": {"licence": "Creative Commons Attribution 4.0 International", "description": "<p>Given a matrix in the field $\\mathbb{Z}_n$. By reducing it to row-echelon form (or otherwise), find a basis for the row space of the matrix, as a list of vectors.</p>"}, "variablesTest": {"condition": "sum(map(\n    if(linearly_independent(x),0,1),\n    x,\n    shown_words\n))>1", "maxRuns": 100}, "advice": "<h4>a)</h4>\n<p>We can find a basis by&nbsp;row-reducing the given matrix to echelon form:</p>\n<p>\\[ \\var{rref_matrix[0]} \\]</p>\n<p>Take the non-zero&nbsp;rows of this matrix as a set of basis vectors, i.e. $\\var{latex(join(map(latex(x),x,basis[0]),', '))}$. This is only one of many possible bases for the row space of the given matrix.</p>\n<h4>b)</h4>\n<p>We can find a basis by&nbsp;row-reducing the given matrix to echelon form:</p>\n<p>\\[ \\var{rref_matrix[1]} \\]</p>\n<p>Take the non-zero&nbsp;rows of this matrix as a set of basis vectors, i.e. $\\var{latex(join(map(latex(x),x,basis[1]),', '))}$. This is only one of many possible bases for the row space of the given matrix.</p>"}, {"name": "Simon's copy of Julie's copy of First order differential equations 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/"}, {"name": "Simon Thomas", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/3148/"}], "parts": [{"type": "gapfill", "prompt": "<p>Solution is:</p>\n<p>$y=\\;\\;$[[0]]</p>\n<p>Input all numbers as integers or fractions &ndash; not as decimals.</p>", "scripts": {}, "sortAnswers": false, "customMarkingAlgorithm": "", "showFeedbackIcon": true, "unitTests": [], "showCorrectAnswer": true, "variableReplacements": [], "gaps": [{"type": "jme", "showPreview": true, "extendBaseMarkingAlgorithm": true, "expectedVariableNames": [], "notallowed": {"strings": ["."], "partialCredit": 0, "showStrings": false, "message": "<p>Input all numbers as integers or fractions.</p>"}, "scripts": {}, "vsetRange": [0.5, 1], "customMarkingAlgorithm": "", "checkingAccuracy": 0.001, "vsetRangePoints": 5, "showFeedbackIcon": true, "checkVariableNames": false, "unitTests": [], "showCorrectAnswer": true, "answerSimplification": "std", "checkingType": "absdiff", "answer": "({b} / {(a + n)}) * (x ^ {n} + ({c} * (x ^ { - a})))", "variableReplacements": [], "marks": 3, "failureRate": 1, "variableReplacementStrategy": "originalfirst"}], "extendBaseMarkingAlgorithm": true, "marks": 0, "variableReplacementStrategy": "originalfirst"}], "metadata": {"description": "<p>Find the solution of&nbsp;$\\displaystyle x\\frac{dy}{dx}+ay=bx^n,\\;\\;y(1)=c$</p>\n<p>rebelmaths</p>", "licence": "Creative Commons Attribution 4.0 International"}, "preamble": {"css": "", "js": ""}, "ungrouped_variables": ["a", "c", "b", "n"], "variable_groups": [], "advice": "<p>$\\displaystyle{x\\frac{dy}{dx}+\\var{a}y=\\simplify[std]{{b}x^{n}}}$ can be solved by the integrating factor method.</p>\n<p>First we divide both sides by $x$ to obtain&nbsp;$\\displaystyle{\\frac{dy}{dx}+\\frac{\\var{a}}{x}y=\\simplify[std]{{b}x^{n-1}}}$</p>\n<p>This is now in the standard form $\\displaystyle{\\frac{dy}{dx}+a(x)y=b(x)}$ which we can solve by multiplying through by the integrating factor $e^{\\int a(x)dx}$</p>\n<p></p>\n<p>In our example, $a(x) =&nbsp;\\frac{\\var{a}}{x}$ so&nbsp;$e^{\\int a(x)dx}=e^{\\int{\\frac{\\var{a}}{x}dx}}=e^{\\var{a}\\ln(x)}=x^\\var{a}$</p>\n<p></p>\n<p>Hence multiplying both sides of $\\displaystyle{\\frac{dy}{dx}+\\frac{\\var{a}}{x}y=\\simplify[std]{{b}x^{n-1}}}$&nbsp;by $x^\\var{a}$ gives</p>\n<p>$\\displaystyle{x^\\var{a}\\frac{dy}{dx}+\\var{a}x^{\\var{a-1}}y=\\simplify[std]{{b}x^{n-1+a}}}$</p>\n<p>We note that we can rewrite the left hand side as $\\frac{d(x^{\\var{a}}y)}{dx}$ (product rule) and hence:</p>\n<p>\\[\\frac{d(x^{\\var{a}}y)}{dx}=\\simplify[std]{{b}x^{a+n-1}}\\]<br/>We can integrate both sides to get:<br/>\\[x^{\\var{a}}y=\\simplify[std]{{b}/{a+n}x^{a+n}+A}\\]<br/>to determine $A$ we use the condition $\\displaystyle{y(1)=\\simplify[std]{{b*(c+1)}/{a+n}}}$ and we see that:</p>\n<p>\\[\\simplify[std]{{b*(c+1)}/{a+n}}=\\simplify[std]{{b}/{a+n}+A}\\]<br/>\\[A = \\simplify[std]{{b*(c+1)}/{a+n}} - \\simplify[std]{{b}/{a+n} = {b*c}/{a+n}}\\]<br/>and so the solution is:<br/>\\[x^{\\var{a}}y=\\simplify[std]{{b}/{a+n}x^{a+n}+{b*c}/{a+n}} \\Rightarrow y=\\simplify[std]{{b}/{a+n}*(x^{n}+{c}*x^{-a})}\\]</p>", "variables": {"a": {"definition": "random(2..8)", "group": "Ungrouped variables", "description": "", "name": "a", "templateType": "anything"}, "b": {"definition": "random(1..9)", "group": "Ungrouped variables", "description": "", "name": "b", "templateType": "anything"}, "c": {"definition": "random(1..5)", "group": "Ungrouped variables", "description": "", "name": "c", "templateType": "anything"}, "n": {"definition": "random(2..5)", "group": "Ungrouped variables", "description": "", "name": "n", "templateType": "anything"}}, "rulesets": {"std": ["all", "fractionNumbers", "!collectNumbers", "!noLeadingMinus"]}, "statement": "<p>Integrating Factor Method:</p>\n<p>Find the solution of:<br/>\\[x\\frac{dy}{dx}+\\var{a}y=\\simplify[std]{{b}x^{n}}\\]</p>\n<p>which satisfies $\\displaystyle{y(1)=\\simplify[std]{{b*(c+1)}/{a+n}}}$</p>", "tags": [], "functions": {}, "variablesTest": {"condition": "", "maxRuns": 100}, "type": "question"}, {"name": "Solve a constant coefficient second order ODE, ", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Bill Foster", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/6/"}, {"name": "Newcastle University Mathematics and Statistics", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/697/"}], "variable_groups": [], "variables": {"correctform": {"group": "Ungrouped variables", "templateType": "anything", "definition": "switch (\n      disc>0, forms[0],\n      disc=0, forms[1],\n      disc<0, forms[2]\n    )", "description": "", "name": "correctform"}, "ltgteq": {"group": "Ungrouped variables", "templateType": "anything", "definition": "switch (\n      disc>0, \"greater than\",\n      disc=0, \"equal to\",\n      disc<0, \"less than\"\n    )", "description": "", "name": "ltgteq"}, "c1": {"group": "Ungrouped variables", "templateType": "anything", "definition": "random(-9..9 except 0)", "description": "", "name": "c1"}, "disc": {"group": "Ungrouped variables", "templateType": "anything", "definition": "b1^2-4*a1*c1", "description": "", "name": "disc"}, "incorrectform": {"group": "Ungrouped variables", "templateType": "anything", "definition": "switch (\n      disc>0, [forms[1],forms[2]],\n      disc=0, [forms[0],forms[2]],\n      disc<0, [forms[0],forms[1]]\n    )", "description": "", "name": "incorrectform"}, "b1": {"group": "Ungrouped variables", "templateType": "anything", "definition": "random(-9..9 except 0)", "description": "", "name": "b1"}, "lambda2": {"group": "Ungrouped variables", "templateType": "anything", "definition": "precround((-b1-sqrt(disc))/(2*a1),3)", "description": "", "name": "lambda2"}, "a1": {"group": "Ungrouped variables", "templateType": "anything", "definition": "random(1..9)", "description": "", "name": "a1"}, "lambda1": {"group": "Ungrouped variables", "templateType": "anything", "definition": "precround((-b1+sqrt(disc))/(2*a1),3)", "description": "", "name": "lambda1"}, "forms": {"group": "Ungrouped variables", "templateType": "anything", "definition": "[\"$A\\\\mathrm{e}^{\\\\lambda_1 x}+B\\\\mathrm{e}^{\\\\lambda_2 x}$\",\"$(A+Bx)\\\\mathrm{e}^{\\\\lambda x}$\",\"$\\\\mathrm{e}^{\\\\alpha x}\\\\biggl(A\\\\cos(\\\\beta x)+B\\\\sin(\\\\beta x)\\\\biggr)$\"]", "description": "", "name": "forms"}}, "ungrouped_variables": ["a1", "correctform", "incorrectform", "forms", "disc", "b1", "c1", "lambda1", "lambda2", "ltgteq"], "functions": {}, "preamble": {"css": "", "js": ""}, "parts": [{"displayType": "radiogroup", "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "showCellAnswerState": true, "choices": ["<p>{correctform}</p>", "<p>{incorrectform[0]}</p>", "<p>{incorrectform[1]}</p>"], "prompt": "<p>Which of the following choices defines the form of the general solution of the differential equation?</p>\n<p>In each case $A$ and $B$ are arbitrary constants, and $\\lambda_1$, $\\lambda_2$, $\\lambda$, $\\alpha$, and $\\beta$ are other constants arising from the solution of the auxiliary equation (their actual values are not important for this part of the question).</p>", "distractors": ["", "", ""], "matrix": [1, 0, 0], "unitTests": [], "shuffleChoices": true, "variableReplacementStrategy": "originalfirst", "showFeedbackIcon": true, "scripts": {}, "minMarks": 0, "type": "1_n_2", "maxMarks": 0, "displayColumns": 1, "showCorrectAnswer": true, "variableReplacements": [], "marks": 0}, {"showCorrectAnswer": true, "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "prompt": "<p>Find the general solution of the differential equation, by setting up an appropriate auxiliary equation, solving it, and entering the solutions &nbsp;$\\lambda_1$ and $\\lambda_2$ &nbsp;of the auxiliary equation in the boxes. &nbsp;If the solutions are real and distinct, enter the greatest solution as $\\lambda_1$; if the solutions are repeated, enter the same values for $\\lambda_1$ and $\\lambda_2$; if the solutions are complex, enter the solution with the greatest imaginary part as $\\lambda_1$.</p>\n<p>Enter your answers to 3 d.p.</p>\n<p>$\\lambda_1=$ [[0]]</p>\n<p>$\\lambda_2=$ [[1]]</p>", "unitTests": [], "sortAnswers": false, "scripts": {}, "gaps": [{"answer": "{lambda1}", "showCorrectAnswer": true, "failureRate": 1, "customMarkingAlgorithm": "", "vsetRangePoints": 5, "showPreview": true, "checkVariableNames": false, "checkingType": "absdiff", "vsetRange": [0, 1], "type": "jme", "showFeedbackIcon": true, "scripts": {}, "extendBaseMarkingAlgorithm": true, "expectedVariableNames": [], "unitTests": [], "checkingAccuracy": 0.001, "variableReplacementStrategy": "originalfirst", "variableReplacements": [], "marks": 1}, {"answer": "{lambda2}", "showCorrectAnswer": true, "failureRate": 1, "customMarkingAlgorithm": "", "vsetRangePoints": 5, "showPreview": true, "checkVariableNames": false, "checkingType": "absdiff", "vsetRange": [0, 1], "type": "jme", "showFeedbackIcon": true, "scripts": {}, "extendBaseMarkingAlgorithm": true, "expectedVariableNames": [], "unitTests": [], "checkingAccuracy": 0.001, "variableReplacementStrategy": "originalfirst", "variableReplacements": [], "marks": 1}], "type": "gapfill", "variableReplacementStrategy": "originalfirst", "variableReplacements": [], "marks": 0, "showFeedbackIcon": true}], "statement": "<p>You are given the differential equation</p>\n  <p>\\[\\simplify{{a1}*y''+{b1}*y'+{c1}*y=0}.\\]</p>", "tags": ["checked2015"], "rulesets": {}, "metadata": {"licence": "Creative Commons Attribution 4.0 International", "description": "<p>Find the solution of a constant coefficient second order ordinary differential equation of the form $ay''+by'+cy=0$.</p>"}, "type": "question", "variablesTest": {"condition": "", "maxRuns": 100}, "advice": "<p>To determine the form of the general solution of the equation</p>\n<p>\\[ay''+by'+c=0,\\]</p>\n<p>first set $y=\\mathrm{e}^{\\lambda x}$, and substitute to obtain</p>\n<p>\\[a\\lambda^2+b\\lambda+c=0,\\]</p>\n<p>for which the solutions are</p>\n<p>\\[\\lambda_{1,2}=\\frac{-b\\pm\\sqrt{b^2-4ac}}{2a}.\\]</p>\n<p>If $b^2-4ac&gt;0$, then the roots are real and distinct, and the solution takes the form</p>\n<p>\\[y(x)=\\var{forms[0]}.\\]</p>\n<p>If $b^2-4ac=0$, then the roots are real and repeated, and the solution takes the form</p>\n<p>\\[y(x)=\\var{forms[1]}.\\]</p>\n<p>If $b^2-4ac&lt;0$, then the roots are complex, and the solution takes the form</p>\n<p>\\[y(x)=\\var{forms[2]},\\]</p>\n<p>where $\\lambda_1=\\alpha+i\\beta$ and $\\lambda_2=\\alpha-i\\beta$.</p>\n<h4>a)</h4>\n<p>In this question we have $\\simplify{{a1}*y''+{b1}*y'+{c1}*y=0}$, and then</p>\n<p>\\[b^2-4ac=\\var{b1^2}-4\\times(\\var{a1*c1})=\\var{disc},\\]</p>\n<p>which is {ltgteq} zero, so the general solution takes the form</p>\n<p>\\[y(x)=\\var{correctform}.\\]</p>\n<h4>b)</h4>\n<p>Making the substitution $y=\\mathrm{e}^{\\lambda x}$, then gives</p>\n<p>\\[\\simplify{{a1}*lambda^2+{b1}*lambda+{c1}=0},\\]</p>\n<p>which has solutions</p>\n<p>\\[\\lambda_1=\\frac{\\var{-b1}+\\sqrt{\\var{disc}}}{\\var{2*a1}}=\\var{lambda1} \\text{ to 3 d.p.,}\\]</p>\n<p>and</p>\n<p>\\[\\lambda_2=\\frac{\\var{-b1}-\\sqrt{\\var{disc}}}{\\var{2*a1}}=\\var{lambda2} \\text{ to 3 d.p.}\\]</p>"}, {"name": "Simon's copy of Julie's copy of Second order differential equations 1", "extensions": ["jsxgraph"], "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": "Simon Thomas", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/3148/"}], "metadata": {"licence": "Creative Commons Attribution 4.0 International", "description": "<p>Solve:&nbsp;$\\displaystyle \\frac{d^2y}{dx^2}+2a\\frac{dy}{dx}+(a^2+b^2)y=0,\\;y(0)=1$ and $y'(0)=c$.&nbsp;</p>\n<p>rebelmaths</p>"}, "statement": "<p>Method of undetermined coefficients</p>\n<p>Solve:<br/>\\[\\simplify[std]{(d^2y/dx^2)+{2*a}*(dy/dx)+{a^2+b^2}y}=0\\]<br/>which satisfies $y(0)=1$ and $y'(0)=\\var{c}$ (where prime denotes the derivative).</p>", "advice": "<p>The auxillary equation is $\\simplify[std]{lambda^2+{2*a}lambda+{a^2+b^2}}=0$.</p>\n<p>On solving this equation we get $\\lambda=\\simplify[std]{{-a}+{b}i}$ and $\\lambda=\\simplify[std]{{-a}-{b}i}$.</p>\n<p>Hence the general solution is:<br/>\\[y = \\simplify[std]{e^({-a}x)(A*sin({b}x)+B*cos({b}x))}\\]<br/>Note that <br/>\\[y'(x)=\\simplify[std]{-{a}e^({-a}x)(A*sin({b}x)+B*cos({b}x))+e^({-a}x)({b}*A*cos({b}x)-{b}*B*sin({b}x))}\\]<br/>Using the conditions $y(0)=1$ and $y'(0)=\\var{c}$ gives:<br/>\\[\\begin{eqnarray*} B &amp;=&amp; 1\\\\ \\simplify[std]{{b}A+{-a}B}&amp;=&amp; \\var{c} \\end{eqnarray*} \\]<br/>This gives $\\displaystyle{A = \\simplify[std]{{c+a}/{b}}}$.</p>\n<p>Hence the solution is:</p>\n<p>\\[y=\\simplify[std]{exp({- a} * x) * (cos({b} * x) + ({c+a} / {b}) * sin({b} * x))}\\]</p>", "parts": [{"showCorrectAnswer": true, "variableReplacements": [], "unitTests": [], "scripts": {}, "gaps": [{"showCorrectAnswer": true, "variableReplacements": [], "unitTests": [], "checkingAccuracy": 1e-05, "scripts": {}, "variableReplacementStrategy": "originalfirst", "notallowed": {"message": "<p>Input all numbers as integers or fractions.</p>", "partialCredit": 0, "strings": ["."], "showStrings": false}, "expectedVariableNames": [], "answer": "exp({- a} * x) * (cos({b} * x) + ({c+a} / {b}) * sin({b} * x))", "marks": 3, "showFeedbackIcon": true, "extendBaseMarkingAlgorithm": true, "customMarkingAlgorithm": "", "type": "jme", "checkingType": "absdiff", "vsetRange": [0, 1], "vsetRangePoints": 5, "checkVariableNames": false, "answerSimplification": "std", "failureRate": 1, "showPreview": true}], "sortAnswers": false, "variableReplacementStrategy": "originalfirst", "marks": 0, "showFeedbackIcon": true, "extendBaseMarkingAlgorithm": true, "customMarkingAlgorithm": "", "type": "gapfill", "prompt": "\n  <p>Solution is:</p>\n  <p>$y=\\;\\;$[[0]]</p>\n  <p>Input all numbers as integers or fractions &ndash; not as decimals.</p>\n  "}], "variable_groups": [], "preamble": {"js": "", "css": ""}, "rulesets": {"std": ["all", "fractionNumbers", "!collectNumbers", "!noLeadingMinus"]}, "functions": {"graphsolution": {"definition": "var c = Numbas.jme.unwrapValue(scope.variables.c);\n\n//var m=Math.abs((c-d*Math.exp(a))/(-a)*Math.exp(-(1-c*a/(d*Math.exp(a)-c))));\nvar div = Numbas.extensions.jsxgraph.makeBoard('400px','400px',\n  {boundingBox:[-5,30,5,-30],\n   axis:false,\n   showNavigation:true,\n   grid:true});\nvar brd = div.board;  \n  var xas = brd.create('line',[[0,0],[1,0]], { strokeColor: 'black',fixed:true});\n  var xticks = brd.create('ticks',[xas,1],{\ndrawLabels: true,\nlabel: {offset: [-4, -10]},\nminorTicks: 0\n  });\n  var yas = brd.create('line',[[0,0],[0,1]], { strokeColor: 'black',fixed:true});\n  var yticks = brd.create('ticks',[yas,5],{\ndrawLabels: true,\nlabel: {offset: [-20, 0]},\nminorTicks: 0\n  }); \nvar p=brd.create('point',[0,1],{fixed:true,name:''});\nvar q=brd.create('line',[[0,0],[1,c]],{fixed:true,name:'',dash:2});\nvar tree;\n//x is the variable in the equation to be input\n  var nscope = new Numbas.jme.Scope([scope,{variables:{x:new Numbas.jme.types.TNum(0)}}]);\n//create a functiongraph from the student input\nfunction userf(t){\nif(tree) {\n  try {\nnscope.variables.x.value = t;\n//the user input is evaluated at x=t\n  var val = Numbas.jme.evaluate(tree,nscope).value;\n  return val;\n  }\n  catch(e) {\nreturn 0;\n  }\n}\nelse\n  return 0;\n}\nvar curve=brd.create('functiongraph',[userf,-10,10],{strokeColor:'red',strokeWidth:2});\n\n   //pick up the student answer and is parsed\n  question.signals.on('HTMLAttached',function(e) {\nko.computed(function(){\nvar expr = question.parts[0].gaps[0].display.studentAnswer();\ntry {\n  tree = Numbas.jme.compile(expr,scope);\n}\ncatch(e) {\n  tree = null;\n}\ncurve.updateCurve();\n\nbrd.update();\n});\n  });  \n\nreturn div;\n  ", "language": "javascript", "parameters": [], "type": "html"}}, "variablesTest": {"condition": "", "maxRuns": 100}, "tags": [], "variables": {"c": {"name": "c", "group": "Ungrouped variables", "definition": "random(1..5)", "templateType": "anything", "description": ""}, "b": {"name": "b", "group": "Ungrouped variables", "definition": "random(1..7)", "templateType": "anything", "description": ""}, "a": {"name": "a", "group": "Ungrouped variables", "definition": "random(-5..5 except 0)", "templateType": "anything", "description": ""}}, "ungrouped_variables": ["a", "c", "b"], "type": "question"}, {"name": "Eigenvalues & eigenvectors of a 2x2", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "contributors": [{"name": "Frank Doheny", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/789/"}], "functions": {}, "variables": {"a12": {"name": "a12", "templateType": "anything", "description": "", "group": "Ungrouped variables", "definition": "k*(a11-c1)"}, "lambda2": {"name": "lambda2", "templateType": "anything", "description": "", "group": "Ungrouped variables", "definition": "max({c1},{a11}+{a22}-{c1})"}, "c1": {"name": "c1", "templateType": "randrange", "description": "", "group": "Ungrouped variables", "definition": "random(14..20#1)"}, "k": {"name": "k", "templateType": "randrange", "description": "", "group": "Ungrouped variables", "definition": "random(1..6#1)"}, "lambda1": {"name": "lambda1", "templateType": "anything", "description": "", "group": "Ungrouped variables", "definition": "min({c1},{a11}+{a22}-{c1})"}, "a11": {"name": "a11", "templateType": "randrange", "description": "", "group": "Ungrouped variables", "definition": "random(1..10#1)"}, "a22": {"name": "a22", "templateType": "anything", "description": "", "group": "Ungrouped variables", "definition": "{k}*{a21}+{c1}"}, "a21": {"name": "a21", "templateType": "randrange", "description": "", "group": "Ungrouped variables", "definition": "random(1..5#1)"}}, "metadata": {"description": "<p>This question concerns the evaluation of the eigenvalues and corresponding eigenvectors of a 2x2 matrix.</p>", "licence": "Creative Commons Attribution-NonCommercial 4.0 International"}, "parts": [{"variableReplacements": [], "showCorrectAnswer": true, "type": "gapfill", "gaps": [{"variableReplacements": [], "minValue": "lambda1", "showCorrectAnswer": true, "type": "numberentry", "precisionType": "dp", "notationStyles": ["plain", "en", "si-en"], "precisionMessage": "You have not given your answer to the correct precision.", "showFeedbackIcon": true, "variableReplacementStrategy": "originalfirst", "precisionPartialCredit": 0, "precision": 0, "correctAnswerFraction": false, "strictPrecision": false, "mustBeReducedPC": 0, "mustBeReduced": false, "maxValue": "lambda1", "showPrecisionHint": false, "allowFractions": false, "scripts": {}, "marks": 1, "correctAnswerStyle": "plain"}, {"variableReplacements": [], "minValue": "lambda2", "showCorrectAnswer": true, "type": "numberentry", "precisionType": "dp", "notationStyles": ["plain", "en", "si-en"], "precisionMessage": "You have not given your answer to the correct precision.", "showFeedbackIcon": true, "variableReplacementStrategy": "originalfirst", "precisionPartialCredit": 0, "precision": 0, "correctAnswerFraction": false, "strictPrecision": false, "mustBeReducedPC": 0, "mustBeReduced": false, "maxValue": "lambda2", "showPrecisionHint": false, "allowFractions": false, "scripts": {}, "marks": 1, "correctAnswerStyle": "plain"}], "prompt": "<p>Calculate the eigenvalues of the matrix A</p>\n<p>\\(\\lambda_1\\) is the lesser of the two eigenvalues and&nbsp;\\(\\lambda_2\\) is the greater of the two eigenvalues;</p>\n<p style=\"padding-left: 30px;\">\\(\\lambda_1\\) =&nbsp;[[0]]</p>\n<p style=\"padding-left: 30px;\">\\(\\lambda_2\\) =&nbsp;[[1]]</p>", "showFeedbackIcon": true, "variableReplacementStrategy": "originalfirst", "scripts": {}, "marks": 0}, {"variableReplacements": [], "showCorrectAnswer": true, "type": "gapfill", "gaps": [{"variableReplacements": [], "minValue": "{lambda1}-{a22}", "showCorrectAnswer": true, "type": "numberentry", "precisionType": "dp", "notationStyles": ["plain", "en", "si-en"], "precisionMessage": "You have not given your answer to the correct precision.", "showFeedbackIcon": true, "variableReplacementStrategy": "originalfirst", "precisionPartialCredit": 0, "precision": 0, "correctAnswerFraction": false, "strictPrecision": false, "mustBeReducedPC": 0, "mustBeReduced": false, "maxValue": "{lambda1}-{a22}", "showPrecisionHint": false, "allowFractions": false, "scripts": {}, "marks": 1, "correctAnswerStyle": "plain"}, {"variableReplacements": [], "minValue": "{lambda2}-{a22}", "showCorrectAnswer": true, "type": "numberentry", "precisionType": "dp", "notationStyles": ["plain", "en", "si-en"], "precisionMessage": "You have not given your answer to the correct precision.", "showFeedbackIcon": true, "variableReplacementStrategy": "originalfirst", "precisionPartialCredit": 0, "precision": 0, "correctAnswerFraction": false, "strictPrecision": false, "mustBeReducedPC": 0, "mustBeReduced": false, "maxValue": "{lambda2}-{a22}", "showPrecisionHint": false, "allowFractions": false, "scripts": {}, "marks": 1, "correctAnswerStyle": "plain"}], "prompt": "<p>For the lesser eigenvalue \\(\\lambda_1\\) the corresponding eigenvector is \\(v_1=\\begin{pmatrix}x\\\\ \\var{a21}\\\\ \\end{pmatrix}\\)</p>\n<p>Enter the value for \\(x=\\)&nbsp;[[0]]</p>\n<p>For the greater eigenvalue \\(\\lambda_2\\) the corresponding eigenvector is \\(v_1=\\begin{pmatrix}x\\\\ \\var{a21}\\\\ \\end{pmatrix}\\)</p>\n<p>Enter the value for \\(x=\\)&nbsp;[[1]]</p>\n<p></p>", "showFeedbackIcon": true, "variableReplacementStrategy": "originalfirst", "scripts": {}, "marks": 0}], "rulesets": {}, "variable_groups": [], "variablesTest": {"condition": "", "maxRuns": 100}, "tags": [], "statement": "<p>Given the matrix</p>\n<p style=\"padding-left: 60px;\">\\(A =\\begin{pmatrix} \\var{a11}&amp;\\var{a12}\\\\ \\var{a21}&amp;\\var{a22}\\\\ \\end{pmatrix}\\)</p>", "preamble": {"css": "", "js": ""}, "ungrouped_variables": ["a11", "c1", "a12", "k", "a21", "a22", "lambda1", "lambda2"], "advice": "<p>The eigenvalues of a matrix are the values of \\(\\lambda\\) that satisfy the relation</p>\n<p style=\"padding-left: 30px;\">\\(|A-\\lambda I| = 0\\)</p>\n<p style=\"padding-left: 30px;\">\\(\\begin{vmatrix} \\var{a11}-\\lambda&amp;\\var{a12}\\\\ \\var{a21}&amp;\\var{a22}-\\lambda\\\\ \\end{vmatrix}=0\\)</p>\n<p>This gives:</p>\n<p style=\"padding-left: 30px;\">\\((\\var{a11}-\\lambda)*(\\var{a22}-\\lambda)-(\\var{a12})*(\\var{a21})=0\\)</p>\n<p style=\"padding-left: 30px;\">\\(\\lambda^2-\\simplify{{a11}+{a22}}\\lambda+\\simplify{{a11}*{a22}-{a21}*{a12}}=0\\)</p>\n<p>This can be solved using factorisation or by formula to give:</p>\n<p style=\"padding-left: 30px;\">\\(\\lambda =\\var{lambda1}\\) and&nbsp;\\(\\lambda =\\var{lambda2}\\)</p>\n<p>An eigenvector \\(v=\\begin{pmatrix} x\\\\ y\\\\ \\end{pmatrix}\\) corresponding to an eigenvalue \\(\\lambda\\) must satisfy the relation: &nbsp;\\((A-\\lambda I)v = 0\\)</p>\n<p>so for \\(\\lambda=\\var{lambda1}\\) &nbsp;</p>\n<p style=\"padding-left: 60px;\">\\(\\begin{pmatrix} \\simplify{{a11}-{lambda1}}&amp;\\var{a12}\\\\ \\var{a21}&amp;\\simplify{{a22}-{lambda1}}\\\\ \\end{pmatrix}\\begin{pmatrix} x\\\\ \\var{a21}\\\\ \\end{pmatrix}=0\\)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</p>\n<p>thus</p>\n<p style=\"padding-left: 60px;\">\\(\\var{a21}x+\\simplify{{a22}-{lambda1}}*\\var{a21}=0\\)</p>\n<p style=\"padding-left: 60px;\">\\(\\var{a21}x=-\\simplify{({a22}-{lambda1})*{a21}}\\)</p>\n<p style=\"padding-left: 60px;\">\\(x=-\\simplify{({a22}-{lambda1})}\\)</p>\n<p></p>", "type": "question"}]}], "showstudentname": true, "timing": {"timeout": {"action": "none", "message": ""}, "timedwarning": {"action": "none", "message": ""}, "allowPause": true}, "name": "more sophisticated mathematics examples", "percentPass": 0, "navigation": {"reverse": true, "startpassword": "", "showresultspage": "oncompletion", "preventleave": true, "allowregen": true, "browse": true, "showfrontpage": true, "onleave": {"action": "none", "message": ""}}, "metadata": {"licence": "Creative Commons Attribution-ShareAlike 4.0 International", "description": "this is a collection of NUMBAS questions taken straight from the NUMBAS database with no editing."}, "duration": 0, "showQuestionGroupNames": false, "feedback": {"feedbackmessages": [], "showtotalmark": true, "intro": "", "advicethreshold": 0, "showanswerstate": true, "allowrevealanswer": true, "showactualmark": true}, "contributors": [{"name": "Josh Lim", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/2990/"}], "extensions": ["jsxgraph", "codewords", "permutations", "stats"], "custom_part_types": [], "resources": []}