Two dimensional covering systems and possible prime producing a^m-b^n
Pith reviewed 2026-05-16 14:23 UTC · model grok-4.3
The pith
For certain bases a and b, |a^m - b^n| always has a prime factor from a fixed small set no matter the exponents.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The central discovery is that there exist integer pairs a and b together with a finite set of primes P so that for every pair m, n at least zero, a^m - b^n has some prime divisor belonging to P. This is realized by partitioning the lattice of exponents into residue classes modulo suitable moduli and assigning to each class a prime p in P for which the congruence a^m ≡ b^n mod p holds throughout that class.
What carries the argument
Two-dimensional covering systems that partition pairs of residue classes (m mod M, n mod N) and assign to each pair a fixed prime p such that a^m ≡ b^n mod p holds on that entire class.
If this is right
- For any a and b admitting such a covering, |a^m - b^n| can equal a prime for only finitely many pairs m, n.
- The conjecture asserts that these coverings are the only possible reasons why |a^m - b^n| might produce only finitely many primes.
- When no such covering exists for a given a and b, the expression should take infinitely many prime values.
Where Pith is reading between the lines
- The same covering technique could be tested on related forms such as a^m + b^n to locate analogous obstructions.
- Numerical search for small a and b without known coverings would provide evidence supporting or challenging the conjecture, though proving infinitude of primes remains separate.
Load-bearing premise
That the two-dimensional coverings constructed for each example are exhaustive, so no further independent obstructions force small prime factors beyond those identified.
What would settle it
An explicit pair a, b with no known two-dimensional covering for which |a^m - b^n| nevertheless has all its prime factors drawn from a finite list for all sufficiently large m and n, or a covered pair that produces a prime outside the listed set for some large exponents.
read the original abstract
We exhibit a new application of two dimensional covering systems, examples of integer pairs $a,b$ for which $a^m-b^n$ has a prime divisor from some given finite set of primes, for every pair of integers $m,n\geq 0$. This leads us to conjecture what are the only possible obstructions to $|a^m-b^n|$ taking on infinitely many distinct prime values.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript exhibits explicit two-dimensional covering systems for selected integer pairs (a, b) such that a^m - b^n is divisible by at least one prime from a fixed finite set for every pair of non-negative integers m, n. These constructions are used to formulate a conjecture identifying the only possible obstructions preventing |a^m - b^n| from taking infinitely many distinct prime values.
Significance. The work extends covering-system techniques to a two-dimensional setting and supplies concrete, verifiable examples that obstruct primality in exponential Diophantine expressions. If the coverings are exhaustive, the resulting conjecture offers a precise classification of obstructions and could serve as a foundation for further results on prime-producing forms, analogous to known applications in the Sierpiński and Carmichael problems.
major comments (1)
- [Examples] The manuscript must supply the complete list of moduli, residue classes, and the associated finite set of primes for each explicit two-dimensional covering (e.g., the covering for the pair a=2, b=3). Without these details it is impossible to confirm that every lattice point (m, n) is covered and that the finite set is minimal.
minor comments (2)
- [Conjecture statement] Clarify whether the absolute value in the conjecture statement is necessary for all a, b or only when a^m < b^n; the current wording leaves the sign convention ambiguous.
- [Examples] Add a short table summarizing the finite prime sets and the dimension of each covering for the worked examples; this would improve readability.
Simulated Author's Rebuttal
We thank the referee for the careful reading of our manuscript and for the constructive suggestion regarding the presentation of our examples. We address the major comment below and will revise the manuscript accordingly.
read point-by-point responses
-
Referee: [Examples] The manuscript must supply the complete list of moduli, residue classes, and the associated finite set of primes for each explicit two-dimensional covering (e.g., the covering for the pair a=2, b=3). Without these details it is impossible to confirm that every lattice point (m, n) is covered and that the finite set is minimal.
Authors: We agree that explicit details are necessary for independent verification. In the revised version we will add complete, tabulated lists for every two-dimensional covering system in the paper. Each table will specify the full set of moduli, the corresponding residue classes for m and n, and the finite set of primes that divide a^m - b^n whenever the pair (m,n) satisfies one of the congruences. The example for a=2, b=3 will be presented first, followed by the remaining cases. These additions will make it straightforward to check that the union of the congruence classes covers all non-negative integer pairs (m,n) and that the listed prime sets are the ones arising from the constructions. revision: yes
Circularity Check
No significant circularity identified
full rationale
The paper constructs explicit two-dimensional covering systems for chosen pairs a, b that force a^m - b^n to have prime divisors only from a fixed finite set for all m, n >= 0. These constructions are presented as independent examples. The conjecture that these represent the only possible obstructions to |a^m - b^n| taking infinitely many prime values follows directly as an extrapolation from the exhibited cases, without any reduction of the central claim to a self-definition, a fitted parameter renamed as a prediction, or a load-bearing self-citation chain. No equations or steps in the derivation chain equate the output conjecture to its inputs by construction.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Two-dimensional covering systems exist and can be constructed to cover all pairs of nonnegative integers m, n with modular conditions forcing divisibility by fixed primes.
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/RealityFromDistinctionreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We exhibit a new application of two dimensional covering systems, examples of integer pairs a,b for which a^m - b^n has a prime divisor from some given finite set of primes, for every pair of integers m,n≥0.
-
IndisputableMonolith/Cost/FunctionalEquationwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
This leads us to conjecture what are the only possible obstructions to |a^m - b^n| taking on infinitely many distinct prime values.
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.