// Numbas version: exam_results_page_options
{"name": "Simon's copy of Basic Set Theory: fun and games with the power set", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "question_groups": [{"pickingStrategy": "all-ordered", "questions": [{"metadata": {"licence": "Creative Commons Attribution-ShareAlike 4.0 International", "description": "<p>Slightly harder introductory exercises about the power set.</p>"}, "preamble": {"css": "", "js": ""}, "tags": [], "extensions": [], "advice": "<p>Since $P(\\left\\{\\right\\}) = 2^{\\left|\\left\\{\\right\\}\\right|} = 2^0 = 1$ we know that $P(\\left\\{\\right\\})$ is a one-element set which contains $\\left\\{\\right\\}$. There is only one possible answer</p>\n<p style=\"text-align: center;\">$ \\left\\{\\left\\{\\right\\}\\right\\}$.</p>\n<hr/>\n<p>We construct the answer gradually. Since $\\left|S\\right| = \\var{n}$</p>\n<ul>\n<li>$\\left|P(S)\\right| = 2^\\var{n}$</li>\n<li>$\\left|P(P(S))\\right| = 2^{\\left|P(S)\\right|} = 2^{2^\\var{n}}$</li>\n<li>$\\left|P(P(P(S)))\\right| = 2^{\\left|P(P(S))\\right|} = 2^{2^{2^\\var{n}}}$.</li>\n</ul>\n<p></p>\n<p></p>", "variables": {"n": {"definition": "random(0..2)", "name": "n", "description": "", "group": "Ungrouped variables", "templateType": "anything"}}, "ungrouped_variables": ["n"], "parts": [{"showPreview": true, "customMarkingAlgorithm": "", "vsetRangePoints": 5, "marks": 1, "extendBaseMarkingAlgorithm": true, "stepsPenalty": 0, "showFeedbackIcon": true, "scripts": {}, "variableReplacements": [], "checkVariableNames": false, "expectedVariableNames": [], "answer": "{set(set())}", "type": "jme", "failureRate": 1, "checkingAccuracy": 0.001, "prompt": "<p>$P(A)$ contains at least the elements $\\left\\{\\right\\}$ and $A$. The case where $\\left\\{\\right\\} = A$ is particularly interesting. What is $P(\\left\\{\\right\\})$?</p>", "unitTests": [], "checkingType": "absdiff", "steps": [{"variableReplacements": [], "checkVariableNames": false, "unitTests": [], "extendBaseMarkingAlgorithm": true, "customMarkingAlgorithm": "", "answer": "0", "type": "jme", "failureRate": 1, "showPreview": true, "checkingAccuracy": 0.001, "prompt": "<p>What is $\\left|\\left\\{\\right\\}\\right|$?</p>", "checkingType": "absdiff", "marks": 1, "expectedVariableNames": [], "vsetRangePoints": 5, "showFeedbackIcon": true, "scripts": {}, "variableReplacementStrategy": "originalfirst", "vsetRange": [0, 1], "showCorrectAnswer": true}, {"variableReplacements": [], "checkVariableNames": false, "unitTests": [], "extendBaseMarkingAlgorithm": true, "customMarkingAlgorithm": "", "answer": "1", "type": "jme", "failureRate": 1, "showPreview": true, "checkingAccuracy": 0.001, "prompt": "<p>Hence, what is $\\left|P(\\left\\{\\right\\})\\right|$?</p>", "checkingType": "absdiff", "marks": 1, "expectedVariableNames": [], "vsetRangePoints": 5, "showFeedbackIcon": true, "scripts": {}, "variableReplacementStrategy": "originalfirst", "vsetRange": [0, 1], "showCorrectAnswer": true}, {"variableReplacements": [], "customMarkingAlgorithm": "", "marks": 0, "extendBaseMarkingAlgorithm": true, "unitTests": [], "type": "information", "prompt": "<p>Hence $P(\\left\\{\\right\\})$ is a set that only contains one element. But it must at least contain the element $\\left\\{\\right\\}$. Ponder this for a moment and then answer the question below, and remember that the NUMBAS syntax for $\\left\\{\\right\\}$ is <code>set().</code></p>", "variableReplacementStrategy": "originalfirst", "showFeedbackIcon": true, "showCorrectAnswer": true, "scripts": {}}], "vsetRange": [0, 1], "variableReplacementStrategy": "originalfirst", "showCorrectAnswer": true}, {"showPreview": true, "customMarkingAlgorithm": "", "vsetRangePoints": 5, "marks": 1, "extendBaseMarkingAlgorithm": true, "stepsPenalty": 0, "showFeedbackIcon": true, "scripts": {}, "variableReplacements": [], "checkVariableNames": false, "expectedVariableNames": [], "answer": "2^2^2^{n}", "type": "jme", "failureRate": 1, "checkingAccuracy": 0.001, "prompt": "<p>If $\\left|S\\right|=\\var{n}$ then what is $\\left|P(P(P(S)))\\right|$?</p>", "unitTests": [], "checkingType": "absdiff", "steps": [{"variableReplacements": [], "checkVariableNames": false, "unitTests": [], "extendBaseMarkingAlgorithm": true, "customMarkingAlgorithm": "", "answer": "2^2^{n}", "type": "jme", "failureRate": 1, "showPreview": true, "checkingAccuracy": 0.001, "prompt": "<p>Using the handy fact, $\\left|P(S)\\right| = 2^{\\var{n}}$.</p>\n<p>Using this handy fact again, we deduce that $\\left|P(P(S))\\right| = 2^{\\left|P(S)\\right|}$, which is</p>", "checkingType": "absdiff", "marks": 1, "expectedVariableNames": [], "vsetRangePoints": 5, "showFeedbackIcon": true, "scripts": {}, "variableReplacementStrategy": "originalfirst", "vsetRange": [0, 1], "showCorrectAnswer": true}, {"variableReplacements": [], "customMarkingAlgorithm": "", "marks": 0, "extendBaseMarkingAlgorithm": true, "unitTests": [], "type": "information", "prompt": "<p>Use the handy fact yet again to determine $\\left|P(P(P(S)))\\right|$.</p>", "variableReplacementStrategy": "originalfirst", "showFeedbackIcon": true, "showCorrectAnswer": true, "scripts": {}}], "vsetRange": [0, 1], "variableReplacementStrategy": "originalfirst", "showCorrectAnswer": true}], "rulesets": {}, "variablesTest": {"condition": "", "maxRuns": 100}, "statement": "<p>We use the notation $\\left|A\\right| = n$ to mean that $A$ contains $n$ elements. This is often called the <strong>cardinality</strong> of the set. Here is a handy fact about the number of elements in a power set.</p>\n<p style=\"text-align: center;\">If $\\left|A\\right| = n$ then $\\left|P(A)\\right| =2^n$.</p>\n<p>Using this fact, answer the following questions regarding the power set.</p>", "name": "Simon's copy of Basic Set Theory: fun and games with the power set", "variable_groups": [], "functions": {}, "type": "question", "contributors": [{"name": "Daniel Mansfield", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/743/"}, {"name": "Simon Thomas", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/3148/"}]}]}], "contributors": [{"name": "Daniel Mansfield", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/743/"}, {"name": "Simon Thomas", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/3148/"}]}