Skip to content
The Lumenary

Practice · Research pathways

AI-assisted mathematical research

AI-assisted mathematical research

Warm-upHuman

To verify a proposed Schur colouring of {1,…,13}\{1, \dots, 13\}, a checker examines every triple (x,y,x+y)(x, y, x + y) with 1≤x≤y1 \le x \le y and x+y≤13x + y \le 13. How many triples is that?

AI-assisted mathematical research

Warm-upHuman

In October 2025 posts by OpenAI researchers said that GPT-5 had found solutions to ten Erdős problems listed as open on erdosproblems.com. Which description of what happened is accurate?

Choose one

AI-assisted mathematical research

CoreHuman

A company's blog post says its model proved an open lemma. It links a Lean file that compiles with no sorry, and a PDF of the informal proof written with the model's help. No one outside the company has commented yet. Using the lesson's labels, which descriptions are accurate? (Choose all that apply.)

Choose all that apply

AI-assisted mathematical research

CoreHuman

Schur's tripling construction gives S(k+1)≥3S(k)+1S(k + 1) \ge 3 S(k) + 1. Starting from S(1)=1S(1) = 1, what lower bound does it give for S(4)S(4)?

AI-assisted mathematical research

CoreHuman

A randomised local search finds verified Schur 4-colourings of {1,…,n}\{1, \dots, n\} for every n≤35n \le 35, and none for n=36n = 36 within its budget. Which conclusion is justified?

Choose one

AI-assisted mathematical research

CoreFormal

Using the lesson's definition IsSchurColouring n c (no colour class of c on {1, …, n} contains x, y, x + y), which Lean statement expresses the lower bound S(3)≥13S(3) \ge 13?

Choose one

AI-assisted mathematical research

CoreFormal

An AI system returns a 3,000-line Lean proof of an open problem whose statement it also formalised. Before you believe that the problem is solved, which of the following must you check? (Choose all that apply.)

Choose all that apply

AI-assisted mathematical research

StretchComputational

Write a verifier is_schur(colouring) (where colouring[x] is the colour of x for 1 <= x <= n and colouring[0] is unused), and Schur's construction triple(colouring, k), which turns a Schur colouring of {1, ..., m} with colours 0, ..., k - 1 into one of {1, ..., 3m + 1} with colours 0, ..., k. The tests apply triple four times starting from [0, 0] (the colouring of {1}) and check every result with your verifier.

Runs entirely in your browser, in an isolated worker. Nothing is sent to a server.

AI-assisted mathematical research

StretchHuman

Working on a paper, you asked an AI system for ideas; it suggested the key construction, which you then checked in detail, generalised and proved correct yourself. It later turned out that a 2019 paper contains a closely related construction. What is the appropriate way to handle credit?

Choose one