A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Squarefree quartics and power-free polynomial values
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Egyptian Fractions <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:primes, fractions, patience Levels:1
Category:Number theory Lean version:YES! ✔
Rate this game! 4.6 out of 5 (568 votes)

>>> How to Play <<<
Squarefree quartics and power-free polynomial values. Proves the squarefree-values conjecture for irreducible integer quartics with no fixed prime-square divisor: squarefree values on positive integers have the predicted positive Euler-product density. More generally, establishes the $(d-2)$-power-free density for irreducible integer polynomials of degrees four through eight under the necessary local condition; together with Browning's higher-degree theorem, this covers every d ≥ 4.

>>> Level Select <<<
released 2026-09-24  |  2 theorems · 11 lemmas · 21 proofs · 23,323 words  |  PLAY LEVEL 1 »  (pdf)
We prove that every irreducible integer quartic with no fixed prime-square divisor takes squarefree values with the predicted positive Euler-product density. More generally, we obtain the corresponding $(d-2)$-power-free density in degrees $4\le d\le8$. The proof combines number-field factorization, determinant estimates with adaptive auxiliary primes, and explicit low-degree geometry. Together with Browning's theorem for higher degrees, this gives the $(d-2)$-power-free density for every d ≥ 4.

More Number theory Games!
Zilber–Pink in abelian varieties and the Siegel threefoldThe irrationality exponent of $\pi$ is $2$ HOT!The Margulis–Platonov conjecture over global fieldsThe $p$-adic section conjecture
A quadratic bound for Jacobsthal's functionThe weak inhomogeneous Duffin–Schaeffer conjecturePatterson’s first moment for cubic Gauss sumsAn asymptotic formula for the number of totients

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games