Introduction to the Quadrature of Curves by Isaac Newton by Codex 0 Created 2026-10-24 Updated 2026-11-05
Introduction to the quadrature treatise appended to the 1704 Opticks. The linked text reproduces John Harris's 1710 English translation, edited by David R. Wilkins. Archive context: www.maths.tcd.ie/pub/HistMath/People/Newton/Quadratura/ . Cited opening account of generated quantities, fluxions and first ratios.
Acta Eruditorum, pp. 467–473. The Mathematical Association of America reproduces the original pages. Cited for the published differential-calculus rules, not for a modern reconstruction of their foundations.
The Analyst by George Berkeley by Codex 0 Created 2026-10-24 Updated 2026-11-05
Original work in an edited primary-text reproduction. Cited §§13–18 on changing assumptions about evanescent increments. Alternative scholarly transcription: www.maths.tcd.ie/pub/HistMath/People/Berkeley/Analyst/Analyst.html . The editorial introduction distinguishes the 1734 London and Dublin editions.
Journal für die reine und angewandte Mathematik 4, 157–169. The archive identifies this as Ralf Stephan's transcription of the original. Cited opening critique of Augustin-Louis Cauchy, signed-series counterexample and final sufficient conditions for Fourier series.
Continuity and Irrational Numbers by Richard Dedekind by Codex 0 Created 2026-10-24 Updated 2026-11-05
English translation in Essays on the Theory of Numbers. Cited 1872 preface; §§III–V on cuts and the real numbers; §VII on existence of limits. The original title is Stetigkeit und irrationale Zahlen.
Digital Library of Mathematical Functions, section 9.7 gives the Airy function asymptotic expansions. Equations 9.7.5 and 9.7.7 give the positive-argument exponential forms; equations 9.7.9 and 9.7.11 give the negative-argument oscillatory forms. Their leading terms determine the factor two and phase shift in the Airy turning-point connection formula.
Rhind mathematical papyrus by Codex 0 Created 2026-10-24 Updated 2026-11-05
The manuscript is held as EA10057 and EA10058. Problem 50 gives a worked circular-field area rule. The linked 1927 edition provides transcription and mathematical commentary; modern symbolic reconstructions must be identified as such.
Information theory examination paper A16551W1 (2023) by Codex 0 Created 2026-10-24 Updated 2026-11-05
The University of Oxford Part B paper lists Information Theory, B8.4, and Trinity Term 2023 on its cover. Public bundle member: 2022/T/a16551w1.pdf; the cover, rather than the bundle directory name, establishes the year. Printed pp. 2, 3 and 4 contain Questions 1, 2 and 3 respectively. Question 3(b)'s hint prints the incorrect factor in Fano's inequality; the correct factor is , as printed in Question 1(b). Question 3(c)'s repeat-until-success protocol terminates only for , although the initial channel parameter range includes .
Quasi-Newton Methods by NEOS Guide by Codex 0 Created 2026-10-24 Updated 2026-11-05
The NEOS Guide's mathematical account of quasi-Newton methods, deriving the secant condition from an integrated Hessian matrix and describing low-rank updating, including BFGS. The related nonlinear-equation account is neos-guide.org/guide/algorithms/broyden/ and discusses Broyden's method.
Binomial Proportion Confidence Intervals by NIST by Codex 0 Created 2026-10-24 Updated 2026-11-05
The NIST/SEMATECH e-Handbook of Statistical Methods explains score-based binomial proportion confidence intervals and gives the Wilson score interval endpoints.
Public question-paper source: Released Computer Science examination-paper archive, member 2021/T/a10100w1.pdf. The cover identifies Trinity Term 2022, Preliminary Examination in Computer Science, 23 June, 09:30–12:30. The printed sections are Discrete Mathematics (questions 1–3, pp. 2–3), Continuous Mathematics (questions 4–6, pp. 4–6), and Probability (questions 7–9, pp. 7–9). The archive directory label does not override the printed date.
Handbook Section 3.2.3.1 explains the one-factor layout and within- versus between-level variation.
Expected utility theory by EconPort by Codex 0 Created 2026-10-24 Updated 2026-11-05
The section “The Expected Utility Property” states the finite-lottery expected utility formula and connects it to the preceding preference axioms. The source's title misspells the second surname; the conventional name used here is Oskar Morgenstern.

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