Experimental Mathematics with AI and Computation

AI RNG: Practical Systems That Ship

Some of the most productive mathematical work begins before a proof exists. You compute examples, you notice a stubborn regularity, you test it against more data, and only then you try to prove the pattern you now believe is real. This style of work is often called experimental mathematics, and AI can strengthen it by accelerating the cycle from data to conjecture to verification.

Premium Gaming TV
65-Inch OLED Gaming Pick

LG 65-Inch Class OLED evo AI 4K C5 Series Smart TV (OLED65C5PUA, 2025)

LG • OLED65C5PUA • OLED TV
LG 65-Inch Class OLED evo AI 4K C5 Series Smart TV (OLED65C5PUA, 2025)
A strong fit for buyers who want OLED image quality plus gaming-focused refresh and HDMI 2.1 support

A premium gaming-and-entertainment TV option for console pages, living-room gaming roundups, and OLED recommendation articles.

$1396.99
Price checked: 2026-03-23 18:31. Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on Amazon at the time of purchase will apply to the purchase of this product.
  • 65-inch 4K OLED display
  • Up to 144Hz refresh support
  • Dolby Vision and Dolby Atmos
  • Four HDMI 2.1 inputs
  • G-Sync, FreeSync, and VRR support
View LG OLED on Amazon
Check the live Amazon listing for the latest price, stock, shipping, and size selection.

Why it stands out

  • Great gaming feature set
  • Strong OLED picture quality
  • Works well in premium console or PC-over-TV setups

Things to know

  • Premium purchase
  • Large-screen price moves often
See Amazon for current availability
As an Amazon Associate I earn from qualifying purchases.

The risk is also real: it is easy to overfit, to confuse correlation with structure, or to believe a conjecture because it looks beautiful in a small dataset. A good workflow keeps the experiment honest.

What experimental mathematics is really doing

At its best, experimental work is not guessing. It is building evidence and sharpening a statement until it becomes provable.

You can think of the process as moving through three layers:

  • Observation: something seems to hold in computed cases
  • Conjecture: the observation is formulated as a precise statement
  • Proof plan: the conjecture is linked to known tools and a path to verification

AI can help in every layer, but it must be guided by constraints and independent checks.

Design the experiment so it produces meaning

Before computing anything, decide what you are trying to learn.

A strong experiment has:

  • A well-defined object: a sequence, a family of graphs, a class of polynomials
  • A parameter range: how far you will compute and why that range is informative
  • A set of invariants: quantities you expect to remain stable or to obey bounds
  • A falsification goal: what kind of counterexample would break the conjecture

If you cannot name a falsification goal, you are not experimenting, you are collecting trivia.

Use AI to generate candidate invariants and normalizations

Many patterns only appear after you normalize the data properly.

Examples:

  • Divide by a natural scale factor
  • Subtract a known main term
  • Compare ratios rather than raw values
  • Reduce modulo small primes to detect arithmetic structure
  • Compute differences to detect polynomial growth

AI is helpful at proposing normalizations, but you should treat its suggestions as hypotheses. For each proposed invariant, compute it across a wide parameter range and check whether it stabilizes.

A disciplined conjecture pipeline

A simple pipeline keeps you from drifting into wishful thinking.

Generate data with reproducibility

Record:

  • The exact definitions used
  • The parameter range and step size
  • Any randomness and the seed
  • Any filtering rules that remove cases

If someone cannot reproduce your dataset, your conjecture becomes hard to trust, even if it is true.

Ask AI to propose conjectures in falsifiable form

Instead of asking for a vague pattern, ask for a short list of precise statements, each with:

  • A quantifier structure: for all n, for all graphs in a class, exists a constant
  • A boundary condition: the minimal n where it claims to hold
  • A predicted error term or bound if it is asymptotic

A conjecture without quantifiers is not a conjecture, it is a slogan.

Stress test with out-of-sample checks

If you computed up to n=200, test the conjecture at n=400 or n=1000 if feasible. If you cannot go higher, test a different family or a different slice of parameters.

Out-of-sample checks are how you avoid being fooled by early behavior.

Search for counterexamples on purpose

The fastest way to gain confidence is to try to break your own conjecture.

Strategies:

  • Probe boundary cases where assumptions barely hold
  • Try extreme parameter values
  • Randomly sample objects if the class is huge
  • Mutate known examples to see if the property survives

AI can propose attack directions, but computation must decide.

The difference between a pattern and a theorem candidate

A theorem candidate usually has one of these features:

  • It can be reframed as an invariant under a transformation
  • It is explained by a known structure, like symmetry, convexity, or linear recurrence
  • It matches a known family of results with a new parameter or refinement
  • It survives aggressive counterexample search

A pattern that disappears when you change the normalization or extend the range is still useful, but it is not yet theorem-shaped.

Where AI helps most in experimental work

AI is unusually good at two tasks that often consume human time.

Translating numeric evidence into symbolic guesses

If you have a sequence of values, AI can propose:

  • A closed form
  • A recurrence
  • A generating function
  • A factorization pattern

You still need to validate these guesses, but the proposal stage becomes faster.

Mapping conjectures to proof tools

Once a conjecture is stated cleanly, AI can propose routes:

  • Induction if the conjecture has a natural n to n+1 structure
  • Invariants and bijections if it is combinatorial
  • Analytic bounds if it is asymptotic
  • Linear algebra if it involves eigenvalues or rank
  • Algebraic identities if it involves symmetric expressions

This is not proof, but it is a plan that reduces search.

checks that keep experiments honest

CheckWhat it detectsHow to run it
Out-of-sample extensionoverfitting to a small rangecompute beyond the original window
Randomized probinghidden counterexamplessample objects across the class
Perturbation testdependence on fragile symmetrymutate inputs slightly and recompute
Modular reductionarithmetic structurecompute values modulo small primes
Normalization variationillusion from scalingtest multiple rescalings and compare

Turning an experiment into a publishable note

A good experimental write-up does not hide uncertainty. It shows the reader what is known, what is tested, and what is still open.

Include:

  • Definitions, parameter ranges, and reproducibility details
  • The strongest conjecture you believe, stated precisely
  • Evidence tables or summaries of checks, not only cherry-picked examples
  • A list of potential proof routes and which obstacles remain
  • Any partial results that are already provable, even if the full conjecture is not

Even if you do not finish the proof yet, you can produce a clear object for future work.

The main virtue: honesty under pressure

Experimental mathematics is powerful because it lets you explore before you know the path. The discipline is to remain honest about what you have and what you do not have.

AI can accelerate the cycle, but it cannot replace the core requirement:

  • A conjecture must be falsifiable
  • Evidence must be reproducible
  • The claim must survive attempts to break it
  • The path to proof must be more than a narrative

When you work this way, computation becomes a compass, not a casino. You are not rolling dice. You are gathering truth.

Keep Exploring AI Systems for Engineering Outcomes

• AI for Discovering Patterns in Sequences
https://ai-rng.com/ai-for-discovering-patterns-in-sequences/

• AI for Symbolic Computation with Sanity Checks
https://ai-rng.com/ai-for-symbolic-computation-with-sanity-checks/

• Formalizing Mathematics with AI Assistance
https://ai-rng.com/formalizing-mathematics-with-ai-assistance/

• Proof Outlines with AI: Lemmas and Dependencies
https://ai-rng.com/proof-outlines-with-ai-lemmas-and-dependencies/

• AI for Building Counterexamples
https://ai-rng.com/ai-for-building-counterexamples/

Books by Drew Higgins