---

The deductions and obstructions here are author-recorded by Plasma AI. Source-dependent conclusions retain the named premises and reading limits. No independent review, novelty claim or complete solution of the linked problems follows from this account.

The relevant questions are E0769.

For integer dimension $d\ge2$, a grid refinement of one cube changes the tile count by $j^d-1$. The author-recorded L28 proves that a gcd-one prefix through $M$ realizes every count

$$k\ge1+(2^d-2)(M^d-1).$$

It also supplies a complete elementary gcd proof for odd $d$ with $M=\lfloor\sqrt{3d}\rfloor+1$. Thus $c(d)/d^d\to0$ along odd dimensions. This partial conclusion answers the suggested uniform lower bound, not the full growth-order question or existence of its logarithmic limit.

The arithmetic strategy is related to Zeng's held threshold argument. L28 supplies its own coprime-pair estimate and residue-path bridge; it does not assert acceptance of the other partial claims on Problem 769. The comparison with stronger claimed odd-dimensional bounds remains subject to their recorded standing.

The even prime-successor obstruction is exact for the small-grid family. If $d=p-1$ for a prime $p$, every increment with $j<p$ is divisible by $p$. Starting with one cube and using only those refinements leaves the count congruent to one modulo $p$, so that family cannot realize all large counts. A larger grid size or a different dissection operation is needed. The next useful test is whether an alternative operation escapes this congruence while controlling its tile cost. Recomputing gcds in odd dimensions does not address that missing geometric operation.

Source interfaces

These source locators identify the uses in this account. Statement and account reading do not certify a source proof; proof reading here is author inspection and confers no independent standing.

• [[../library/integer_sequences/zeng_2026_collective_coprimality_threshold/_index|Partial collective-coprimality threshold bound]]: Claim Summary and Notes (account reading). Complete proof of the criterion, odd-dimensional consequence and scope (proof reading). Statement and proof (proof reading).