Exam Instance

HTTP 200 OK
Allow: GET, HEAD, OPTIONS
Content-Type: application/json
Vary: Accept

{
    "url": "https://numbas.mathcentre.ac.uk/api/exams/1854/?format=api",
    "name": "mathcentre: Greatest common divisor and congruences",
    "published": true,
    "project": "https://numbas.mathcentre.ac.uk/api/projects/701/?format=api",
    "author": {
        "url": "https://numbas.mathcentre.ac.uk/api/users/697/?format=api",
        "profile": "https://numbas.mathcentre.ac.uk/accounts/profile/697/?format=api",
        "full_name": "Newcastle University Mathematics and Statistics",
        "pk": 697,
        "avatar": {
            "20x20": "https://numbas.mathcentre.ac.uk/media/avatars/UnivNcle-shield_mKn5GZP.20x20.png",
            "40x40": "https://numbas.mathcentre.ac.uk/media/avatars/UnivNcle-shield_mKn5GZP.40x40.png",
            "150x150": "https://numbas.mathcentre.ac.uk/media/avatars/UnivNcle-shield_mKn5GZP.150x150.png"
        }
    },
    "edit": "https://numbas.mathcentre.ac.uk/exam/1854/mathcentre-greatest-common-divisor-and-congruences/?format=api",
    "preview": "https://numbas.mathcentre.ac.uk/exam/1854/mathcentre-greatest-common-divisor-and-congruences/preview/?format=api",
    "download": "https://numbas.mathcentre.ac.uk/exam/1854/mathcentre-greatest-common-divisor-and-congruences.zip?format=api",
    "source": "https://numbas.mathcentre.ac.uk/exam/1854/mathcentre-greatest-common-divisor-and-congruences.exam?format=api",
    "metadata": {
        "notes": "",
        "description": "<p>Given two numbers, find the gcd, then use B&eacute;zout's algorithm to find $s$ and $t$ such that $as+bt=\\operatorname{gcd}(a,b)$.</p>\n<p>Finally, find all solutions of an equation $\\mod b$.</p>",
        "licence": "Creative Commons Attribution 4.0 International"
    },
    "status": "ok",
    "resources": [],
    "questions": [
        "https://numbas.mathcentre.ac.uk/api/questions/568/?format=api"
    ]
}