Meeting Mob
Select an algorithm to run
🔢
Fibonacci Divisibility
Tests if (4n+1) divides (F
n
+ C) for a given range of n values. Uses optimized Montgomery reduction for high-performance computation.
Available
🔍
Prime Divisibility Tester
Tests if p
3n
divides (n² + 1), where p
k
is the k-th prime number. Uses streaming prime generation for efficient computation up to 10 billion.
Available
🌀
Tribonacci Exception Finder
Finds exceptions to a conjecture about Tribonacci numbers: values of n where no N ≤ bound × n satisfies n | a
N
(Tribonacci divisibility).
Available
ƒ(x)
Polynomial Coefficient Bound
Estimates the least c so that |C
k
(1 / P((1-mx)/x))| < m
c·k
by sampling random integer polynomials.
Available
🧮
Digit-Coefficient Test
Tests whether the k-th digit of 1 / P(n) in base (n+m) matches a
k
from 1 / P((1-mx)/x) under the n ≥ m² + a
k+1
condition.
Available
🔁
Multiplicative Order Checker
Searches for counterexamples where ord
|p
n
−q
n
|
(p) ≠ ord
|p
n
−q
n
|
(q). Uses arbitrary-precision BigInt arithmetic.
Available
🧠
Power-5 Digit Sum Expression Test
Computes the minimum of 10S
5
(5
m
) + 12S
2
(5
m
) - 6log
2
(3)S
3
(5
m
) over m = 1..MAX.
Available
🧮
Power-5 Shifted Constant Minimum
Computes the minimum of 10S
5
(5
m
) + 12S
2
(5
m
) - (6log
2
(3)-k)S
3
(5
m
) over m = 1..MAX using the Rust backend worker (up to 64 CPU threads).
Available
v
loading…
- Headless + SQLite Job Store (WAL)