GET /api/questions/11924/?format=api
HTTP 200 OK
Allow: GET, HEAD, OPTIONS
Content-Type: application/json
Vary: Accept

{
    "url": "https://numbas.mathcentre.ac.uk/api/questions/11924/?format=api",
    "name": "Factorise polynomial into irreducible factors",
    "published": true,
    "project": "https://numbas.mathcentre.ac.uk/api/projects/601/?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/question/11924/factorise-polynomial-into-irreducible-factors/?format=api",
    "preview": "https://numbas.mathcentre.ac.uk/question/11924/factorise-polynomial-into-irreducible-factors/preview/?format=api",
    "download": "https://numbas.mathcentre.ac.uk/question/11924/factorise-polynomial-into-irreducible-factors.zip?format=api",
    "source": "https://numbas.mathcentre.ac.uk/question/11924/factorise-polynomial-into-irreducible-factors.exam?format=api",
    "metadata": {
        "notes": "",
        "licence": "Creative Commons Attribution 4.0 International",
        "description": "<p>$f(X)$ and $g(X)$ are polynomials over $\\mathbb{Z}_n$.</p>\n<p>Find their greatest common divisor (GCD) and enter it as a monic polynomial.</p>\n<p>Hence factorize $f(X)$ into irreducible factors.</p>"
    },
    "status": null,
    "resources": []
}