Only the supplied question extract is held. The Oxford C2 support-page record attributes it to 2007; the page does not establish the historical stage or sitting date.
Only supplied question extracts are held. The Oxford C2 support-page records attribute them to 2008; they do not establish the historical stage or sitting date.
Only the supplied question extract is held; Oxford's C2 support-page record attributes it to 2009. The page does not establish its historical examination stage or sitting date.
The held files are question extracts attributed to 2010 by Oxford's C2 support-page records. They do not establish a full examination paper or its historical stage.
Source paper: www.whatdotheyknow.com/request/oxford_physics_past_papers_2/response/2340696/attach/5/Physics%20Papers%202016.pdf?cookie_passthrough=1. The cover dates this paper to Trinity Term 2017, 14 June; the bundle's 2016 filename does not determine its year. The four marked requests in each question are scoped a–d below. Computational-basis vectors use left-to-right qubit order unless another order is explicitly stated.
Source paper: www.whatdotheyknow.com/request/oxford_physics_past_papers_2/response/2340696/attach/6/Physics%20Papers%202017.pdf?cookie_passthrough=1. The cover identifies C2 on 11 June 2018; the annual bundle's 2017 filename does not determine the examination year. All six questions are solved. Optical fields use time dependence ; quantum pulse sequences are applied from left to right as specified in the source.
The cover establishes Trinity Term 2019 despite the bundle's 2018 filename. All six questions are solved, including all alternatives to the requested choice of four. The symbol in question 1 is the supplied degeneracy factor; the amplitudes in question 4 have a separate meaning.
The cover dates this examination to 11 June 2021; the public bundle's filename is not the examination year. Source bundle pages 28–33. Solutions use the original conventions, with the Ramsey population-sign inconsistency identified explicitly in part 3(c).
Source bundle pages 25–30. The cover establishes 2022 despite the attachment filename. The solutions use the original PDF's port labels and distinguish signed carrier-phase conventions.
Solutions to all three questions of the examination held on 12 January 2023. The cover also says Hilary Term 2022; the examination date and source filename determine the year used here. The numbered headings identify source parts without reproducing the questions. Corrections to printed formulas are explained where they arise.
Solutions to all three questions of the paper held on 16 January 2025, including both inline subparts of f. Numbered headings identify the source parts; the question statements are not reproduced.
Solutions to all three questions of the Introduction to schemes course of the University of Oxford, Part C, sat on 1 June 2021. Source: Oxford's released examination PDF, compilation pages 103–106; paper pages 1–4. The original question and letter labels are retained; the paper has no Roman subparts. The correction to the printed closed-subset description in 1(b), and the meaning of the comparison of structure sheaves in 1(c), are explained where they arise.
Solutions to all three questions of the Introduction to schemes course of the University of Oxford, Part C, sat on 8 June 2023. Source: Oxford's released examination PDF, compilation pages 346–348; paper pages 1–3. The original numeric, letter and Roman labels are retained. The compactness hypotheses in the valuative criterion and the interpretation of the removed section in 3(e) are made explicit below.
Solutions to all surviving material, Question 3. TODO: Questions 1 and 2 cannot be answered from this release: printed pages 2–3 are blank. No missing question text or subpart structure is inferred.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact