Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
A strict useful-supply obstruction to distinct covers
_proof: Exact class-support counts and a pointwise forced-excess bound limit the total supply available to meet all prime-power cylinder deficits.
Let be an integer and a prime. Write
In particular, . The notation denotes the positive-divisor sum; it is not an excess-mass variable. Assume .
The full distinct nonunit-divisor profile contains one residue class for each divisor of , with every chosen freely. Each modulus occurs once, and modulus one is excluded.
Statement
Define
If
no placement of the full profile has incidence mass at least in every cylinder modulo inside . Consequently no family of congruence classes with pairwise distinct moduli dividing can cover all integers. The family may use all or only some of those moduli.
This is a sufficient exclusion criterion for every finite prime support and every choice of exponents. There is no oddness assumption and no cap on pointwise multiplicity. It does not assert that the strict inequality holds for every or every prime divisor .
Meaning of the bound
Every cylinder modulo contains points. The full profile's classes with moduli coprime to contribute incidence mass in each cylinder, independently of their residues. Covering therefore requires the classes whose moduli are divisible by to contribute at least in each cylinder.
A class of modulus , where and , contributes on exactly cylinders. Contributions greater than already exceed the required threshold on each cylinder they meet. Subtracting this forced excess from their total mass gives . Equivalently,
The proof defines useful supply as incidence mass capped at in each cylinder. The subtracted waste is excess relative to that threshold, not a count of points wasted in an actual cover. This distinction permits the argument without any overlap or rigidity assumption.
Adding omitted classes does not decrease any cylinder mass. Thus failure for the full profile implies failure for every distinct subprofile. Repeated moduli do not obey the fixed inventory used to compute , and are outside the conclusion. Exclusion of a one-cover also excludes any higher covering multiplicity within the same distinct-modulus domain.
Boundaries and standing
The guards are strict: when , or when but , this criterion gives no exclusion. In particular, is not a contradiction. Failure of the criterion establishes neither a cover nor feasibility of the cylinder constraints. The proof includes the valid boundary , when the frame is a pure prime power.
The complete proof and its subprofile consequence are author-recorded at tier 0, with no independent whole-claim acceptance or formal verification. They use only finite counting, the elementary coprime congruence argument given in the proof, and a finite geometric sum. No other native claim or source-result premise is consumed. No novelty, prior-art assessment, or resolution of an erdosproblems.com problem is asserted.
The supplied proof has no identified gap. Its verification requires only this statement and proof, with no mathematical programs, numerical grids, or private inputs.