Project Euler problem 948 2025-12-01
Numerical solution:
1033654680825334184Earliest known public leak: github.com/lucky-bai/projecteuler-solutions/issues/87
Programs:
Poetiq 2025-12-01
Ubuntu 25.10 bug 2025-11-30
Ubuntu 25.10 2025-11-30
Project Euler problem 972 2025-11-30
Numerical solution:
3575508Earliest known public leak:
Programs:
AI Mathematical Olympiad 2025-11-30
Not too exciting because of the high school knowledge olympiad level, but respectable.
- Every problem has one final integer answer:Also unlike Project Euler and like IMO, all only limited computations are required, i.e. you are not expected to do full blown program generation to reach a final answer. Which makes this further less exciting.
Physics Derivation Graph 2025-11-30
PhysLean 2025-11-30
Formalization of physics project 2025-11-30
Formalization of physics 2025-11-30
Formalization of X 2025-11-30
This section is about formalization efforts of specific fields of mathematics.
Project Euler problem 971 2025-11-23
Numerical solution:
33626723890930Earliest known public leak:
Programs:
Project Euler problem 970 2025-11-19
Numerical solution:
44754029Earliest known public leak: x.com/cirosantilli/status/1990363555309490585
Programs:
ORCA Benchmark Created 2025-11-19 Updated 2025-11-30
This one doesn't seem to exciting to be honest, but it might be useful. Sample question:and it expects the correct answer down to the cents:It should be noted that Project Euler has such "precision matters" problems.
53892.27
Closed AI math benchmark Created 2025-11-19 Updated 2025-11-30
Even more than in other areas of benchmarking, in maths where you only have a right or wrong answer, and it is costly to come up with good sample problems, some benchmarks have adopted private test data sets.
The situation is kind of sad, in that ideally we should have open data sets and only test them on models that were trained on data exclusively published before the problem publish date.
However this is not practical for the following reasons:
List of math AI benchmarks 2025-11-19
3D-printed firearm 2025-11-18
Here's an execution for 2, 3. When Furthermore, note that if therefore we can always make
a != 1 we use a as the extra numbers instead of b: 1 | 2 2(1) ...
2 | 2 2(0) 2(1) ...
3 | 3 2(1) 2(0) 2(1) ...
4 | 3 2(0) 2(0) 2(1) ...
5 | 2 3(2) 2(1) 2(0) 2(0) ...
6 | 2 3(1) 2(1) 2(0) 2(1) ...
7 | 2 3(0) 2(1) 2(0) 2(1) ...
8 | 3 3(2) 2(0) 2(0) 2(1) ...
9 | 3 3(1) 2(0) 2(0) 2(1) ...
10 | 3 3(0) 2(0) 2(0) 2(1) ...
11 | 2 2(1) 3(2) 2(1) 2(0) 2(1) ...
12 | 2 2(0) 3(2) 2(1) 2(0) 2(1) ...
13 | 3 2(1) 3(1) 2(1) 2(0) 2(1) ...
14 | 3 2(0) 3(1) 2(1) 2(0) 2(1) ...
15 | 2 2(1) 3(0) 2(1) 2(0) 2(1) ...
16 | 2 2(0) 3(0) 2(1) 2(0) 2(1) ...
17 | 3 3(2) 3(2) 2(0) 2(0) 2(1) ...a = 1, then the a, b sequence is a subset of the b, a sequence e.g.:1, 2 = [1, 2, 2, 1, 1, 2, 1, ...]
2, 1 = [ 2, 2, 1, 1, 2, 1, ...]a not be 1 by switching the pair and then using the generalized algorithm with a != 1. Nilsson algorithm for the Kolakoski sequence 2025-11-18
This algorithm is more efficient in space, using only , as it recursively compresses the state required to keep track of what to do next.
Time is still .
The table at maths-people.anu.edu.au/~brent/pd/Kolakoski-UNSW.pdf page 20 has a summary image, but it is hard to understand.
1 2(0) 1(1)The starting state is:which means that it implicitly contains infinitely many The actual algorithm will of course omit as many trailing
2 | 2 2(1) 2(1) 2(1) 2(1) ...2(1) at the end which we abbreviate just as:2 | 2 2(1) ...2(1) as it can.The update rules are:Note that both rules don't overlap so that each update is always determined by only one of them at a time.
- go left to right:
- flip:continue going left to right.
x(0) y(0) !x((!x)-1) unchanged - repeat:and then stop further updates.
x(0) y(n > 0) x(x-1) y(n - 1)
- flip:
Also the first column is always implicitly
(0).2 | 2 2(1) ...
3 | 2 2(0) 2(1) ...Here we:
2 | 2 2(1) ...
3 | 2 2(0) 2(1) ...
4 | 1 2(1) 2(0) 2(1) ...2 | 2 2(1) ...
3 | 2 2(0) 2(1) ...
4 | 1 2(1) 2(0) 2(1) ...
5 | 1 2(0) 2(1) 2(0) 2(1) ... 2 | 2 2(1) ...
3 | 2 2(0) 2(1) ...
4 | 1 2(1) 2(0) 2(1) ...
5 | 1 2(0) 2(0) 2(1) ...
6 | 2 1(0) 2(1) 2(0) 2(1) ...
7 | 1 1(0) 2(0) 2(0) 2(1) ...
8 | 2 2(1) 1(0) 2(1) 2(0) 2(1) ...
9 | 2 2(0) 1(0) 2(1) 2(0) 2(1) ...
10 | 1 1(0) 1(0) 2(0) 2(0) 2(1) ...
11 | 2 2(1) 2(1) 1(0) 2(1) 2(0) 2(1) ...
12 | 2 2(0) 2(1) 1(0) 2(1) 2(0) 2(1) ...
13 | 1 2(1) 2(0) 1(0) 2(1) 2(0) 2(1) ...
14 | 1 2(0) 2(0) 1(0) 2(1) 2(0) 2(1) ...
15 | 2 1(0) 1(0) 1(0) 2(0) 2(0) 2(1) ...
16 | 1 2(1) 2(1) 2(1) 1(0) 2(1) 2(0) 2(1) ... There are unlisted articles, also show them or only show them.