Topics (119k) Articles (119k) Users (289) Discussions (237) Comments (383) Files (715) New article
No, they couldn't be like everyone else and be a "department", proud mathematicians had to be an "Institute"!
Department of Engineering Science of the University of Oxford by 
Ciro Santilli 40 Updated 2025-07-16
Ciro Santilli 40 Updated 2025-07-16Moodle instance of the Mathematical Institute of the University of Oxford.
Has a mixture of open access and closed access. But at least it can have open access unlike the in-house systems such as Canvas where everything is necessarily paywalled!
Sometimes things appear open but don't show any meaningful content if you are not logged in, which is annoying.
But at least it gives a clear public course list, thing that certain departments (cough Department of Physics of the University of Oxford cough).
The organization is a bit crap, when you expand e.g. C Michaelmas term it shows nothing, just a search.
The way to go is via the year year categories e.g. "Year 2022-23": courses.maths.ox.ac.uk/course/index.php?categoryid=734. Term splitting is annoying, but one can stand it.
Largest known ranks of an elliptic curve over the rational numbers by Ciro Santilli 40 Updated 2025-07-16
Ciro Santilli 40 Updated 2025-07-16web.math.pmf.unizg.hr/~duje/tors/rankhist.html gives a list with Elkies (2006) on top with:TODO why this non standard formulation?
Their status is a mess as of 2020s, with several systems ongoing. Long live the "original" collegiate university!
math.mit.edu/classes/18.783, Wow, good slides! Well organized site! This is a good professor! And brutal course. 25 lectures, and lecture one ends in BSD conjecture!
Some points from math.mit.edu/classes/18.783/2022/LectureSlides1.pdf:
Mordell's theorem guarantees that the rank (number of elements in the generating set of the group) is always well defined for an elliptic curve over the rational numbers. But as of 2023 there is no known algorithm which calculates the rank of any curve!
It is not even known if there are elliptic curves of every rank or not: Largest known ranks of an elliptic curve over the rational numbers, and it has proven extremely hard to find new ones over time.
TODO list of known values and algorithms? The Birch and Swinnerton-Dyer conjecture would immediately provide a stupid algorithm for it.
The elliptic curve group of all elliptic curve over the rational numbers is always a finitely generated group.
The number of points may be either finite or infinite. But when infinite, it is still a finitely generated group.
For this reason, the rank of an elliptic curve over the rational numbers is always defined.
TODO example.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.
Figure 3. Visual Studio Code extension installation.
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. 
- Infinitely deep tables of contents:
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