Wiki
Wiki

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 N>1N>1 be an integer and p∣Np\mid N a prime. Write

a=vp(N)≥1,M=N/pa,S=σ1(M)=∑d∣Md,D=2M−S.a=v_p(N)\ge1,\qquad M=N/p^a,\qquad S=\sigma_1(M)=\sum_{d\mid M}d,\qquad D=2M-S.

In particular, gcd⁡(p,M)=1\gcd(p,M)=1. The notation σ1\sigma_1 denotes the positive-divisor sum; it is not an excess-mass variable. Assume D>0D>0.

The full distinct nonunit-divisor profile contains one residue class bn(n)=bn+nZb_n(n)=b_n+n\mathbb Z for each divisor n>1n>1 of NN, with every bnb_n chosen freely. Each modulus occurs once, and modulus one is excluded.

Statement

Define

U=Spa−1p−1−∑1≤j≤a, m∣MM/m>D(M/m−D)pa−j.U=S\frac{p^a-1}{p-1} -\sum_{\substack{1\le j\le a,\ m\mid M\\M/m>D}} (M/m-D)p^{a-j}.

If

U<Dpa,U<Dp^a,

no placement of the full profile has incidence mass at least MM in every cylinder modulo pap^a inside Z/NZ\mathbb Z/N\mathbb Z. Consequently no family of congruence classes with pairwise distinct moduli n>1n>1 dividing NN 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 NN or every prime divisor pp.

Meaning of the bound

Every cylinder modulo pap^a contains MM points. The full profile's classes with moduli coprime to pp contribute incidence mass S−MS-M in each cylinder, independently of their residues. Covering therefore requires the classes whose moduli are divisible by pp to contribute at least DD in each cylinder.

A class of modulus pjmp^jm, where 1≤j≤a1\le j\le a and m∣Mm\mid M, contributes M/mM/m on exactly pa−jp^{a-j} cylinders. Contributions greater than DD already exceed the required threshold on each cylinder they meet. Subtracting this forced excess from their total mass gives UU. Equivalently,

U=∑j=1a∑m∣Mmin⁡(M/m,D)pa−j.U=\sum_{j=1}^a\sum_{m\mid M}\min(M/m,D)p^{a-j}.

The proof defines useful supply as incidence mass capped at DD 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 UU, 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 D≤0D\le0, or when D>0D>0 but U≥DpaU\ge Dp^a, this criterion gives no exclusion. In particular, U=DpaU=Dp^a is not a contradiction. Failure of the criterion establishes neither a cover nor feasibility of the cylinder constraints. The proof includes the valid boundary M=1M=1, 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.