{ "axiom_allowlist": [ "propext", "Classical.choice", "Quot.sound" ], "claim_parameter_contracts": { "integer_maximum": { "additional_analytic_inputs": [], "declaration": "IntegerMainBinding.integer_maximum_binding", "domain_condition": "Every member of S is prime; S may be empty. Integer starts range over all Int; gap distance is Nat and positive via IntConsecutive.", "parameters": [ "S : Finset Nat", "hS : KKFiniteCoreDraft.PrimeFamily S" ], "type_and_proof_source_changed": false }, "main_eq1_and_integer_main_eq1": "The real cutoff family is proved to satisfy PrimeFamily; c>0 and an eventual real threshold precede forall y. All hypotheses are read from the unchanged exact theorem types.", "meaning_of_assumptions_array": "No additional analytic input or custom axiom. Explicit theorem parameters and defining domain conditions remain in the exact statement type." }, "classification": "SAME_FAMILY_AUTHOR_EDITORIAL_DELTA_SELF_REVIEW_INDEPENDENT_PENDING", "current_three_claim_plan": { "bound_manuscript_sha256": "50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521", "claims": [ { "assumptions": [], "coverage": "full", "declaration": "PrimaryMain.manuscript_main_goal", "id": "main_eq1", "locator": "Manuscript Eq.(1): eventual full-prime-cutoff cyclic two-residue Jacobsthal survivor-gap bound.", "target": "PrimaryMain.lean" }, { "assumptions": [], "coverage": "full", "declaration": "IntegerMainBinding.integer_maximum_binding", "id": "integer_maximum", "locator": "Definition of G2 preceding Eq.(1): attained largest gap over all integer starts, including negative starts and the period boundary.", "target": "IntegerMainBinding.lean" }, { "assumptions": [], "coverage": "full", "declaration": "IntegerMainBinding.manuscript_integer_main_goal", "id": "integer_main_eq1", "locator": "Eq.(1), stated literally with the attained integer-gap definition and full prime cutoff.", "target": "IntegerMainBinding.lean" } ], "does_not_bind_new_manuscript": true, "path": "output/publication-scope-a-oct8/verification-plan.json", "role": "HISTORICAL_ORIGIN_PLAN_REFERENCE; does not bind corrected manuscript or updated portable profile", "sha256": "b5457a6b8b17ee895e0a34729380782bcc84d61b242e2051c17be77bd0ec93a6" }, "editorial_delta": { "Lean_sources_changed": false, "changes": [ "Section3 collision divisors1,2,3", "Nine original locators restored as plain/code text", "O3 chooseB and little-o parentheses restored inside full math expressions", "O4 whole reserve quotient math expression", "O6 rendered asymp command" ], "historical_map_hash_domain_note": "Raw author JSON and sorted public JSON decode identically. The raw2c62 hash is not the public5d9c byte hash. Current corrected-map hash is pinned externally in the new local self-review to avoid self-reference.", "independent_delta_review": "PENDING", "old_Opus_result": "PASS_SOURCE_REVIEW of prior4ed5 manuscript bytes with editorial corrections; not approval of corrected bytes.", "original_author_raw_map": { "bytes": 80283, "path": "output/paper-rewrite-oct8/proof-to-exposition-map.json", "sha256": "2c62d14df398b40c53b1a8f713378a3c302459ed50278dc23edd5e8b05ca2109" }, "prior_reviewed_manuscript": { "bytes": 38643, "path": "output/portable-publication-profile-oct8/files/manuscript.md", "sha256": "4ed5c60e1643d4f54afbff0d277c9237eb238a1d4daa64707a91edda64bd392b" }, "prior_reviewed_public_map": { "bytes": 80283, "path": "output/portable-publication-profile-oct8/files/proof-to-exposition-map.json", "sha256": "5d9c7203da5d4eaf41c95a8af7c2c1a7307e06e203d27e6e6c6ca39899defcea" }, "profile_updates_owner": "root; this map does not certify updated profile binding", "public_serialization": "UTF-8 json.dumps(indent=2,ensure_ascii=False,sort_keys=True) plus LF", "section9_exposition_utf8_sha256": "def67be9fa1f4c422e0032dee58c4cbed74b1fb3eae695917e95eda60fd59393" }, "exact_statement_precision": [ "The main cutoff is every natural prime with its real cast <=y, never the auxiliary sqrt(y) cutoff.", "Integer starts range over all Z, including negative values; distances are positive Nat. Interior offsets are exactly 0=period; the empty prime family has period 1 and maximum 1.", "The main existential constant is concretely primaryCoefficient=1/chooseB(12)>0. Threshold is eventual real Y; no optimized numerical onset is claimed.", "Positive counting intervals include 1 and exclude 0. Psi counts prime divisors <=real Z; floor Z+1 is the strict Mathlib convention adapter.", "Reserved primes have inclusive endpoints y/2<=p<=y; the strict dyadic theta strip is a subset, enough for the supply bound.", "Finite Rankin needs alpha>0 and only finite-prime local geometric summability. No all-natural summability at alpha<=1 is invoked.", "Original H9/M8/P10/general S are neither premises nor proved full conclusions of the three main claims.", "Original Eq23 parameter limits have proved chosen-B versions; original Eq24 for every fixed A>4 remains open.", "Original Eq27 endpoint is proved via the primary theorem but is outside the three mapped claims; original separate Eq28 argument/pricing stays open.", "Real casts and floors are retained in actual completion and mass inequality; cover length m gives distance at least m+1.", "Cover equivalence quantifies m:Nat including 0. The vacuous m=0 cover corresponds to 1<=G2; for the empty prime family period=G2=1." ], "frozen_source_bytes": 310624, "frozen_source_count": 38, "frozen_sources": [ { "bytes": 7575, "path": "output/publication-scope-a-oct8/files/ActualBoundingSieve.lean", "sha256": "594b6695d429f3f3afd144925eb7567b613ca6ba4c9ee56a2de6d260f5f32782" }, { "bytes": 2826, "path": "output/publication-scope-a-oct8/files/Arithmetic.lean", "sha256": "e97f06258ece1ed02d30a73e73149bcf4cdf695b188fd3b7d7049dfec6270a75" }, { "bytes": 1887, "path": "output/publication-scope-a-oct8/files/Bridges.lean", "sha256": "abb24fd3e031f070ff19c20cebbb2063eb22d76c75c8c0f891ad5c9f62f671be" }, { "bytes": 6959, "path": "output/publication-scope-a-oct8/files/CRTMoments.lean", "sha256": "a9ef14df63a94ed4b51dc1c290b4cbb750ca517c58a519020ffc7e30b5e7fb36" }, { "bytes": 6215, "path": "output/publication-scope-a-oct8/files/DivisorMoments.lean", "sha256": "9be86aa88442c3c7662442d662adfe6266529d413c0f47670fc99cdc2a65eaf3" }, { "bytes": 13488, "path": "output/publication-scope-a-oct8/files/EarlyCover.lean", "sha256": "0b884aca9d50098665535a5bd4dedd9fa00e96b95b13fb8e48a4037b83ca9f59" }, { "bytes": 7674, "path": "output/publication-scope-a-oct8/files/EulerRatio.lean", "sha256": "0a09cda1f89f410af890f9085bfbda225136f69ebeab17fbd5ba5e4d13350294" }, { "bytes": 3391, "path": "output/publication-scope-a-oct8/files/FactorialLogBounds.lean", "sha256": "0b396c1731097a09b0a154b3c54c2b102699e880b5c51aae984ae58f88e564ea" }, { "bytes": 7919, "path": "output/publication-scope-a-oct8/files/FactorialWheel.lean", "sha256": "4f2baae48b58657da06269f91c7534bb8293b6a4943f62e8fe40897927181ea4" }, { "bytes": 8486, "path": "output/publication-scope-a-oct8/files/FiniteCoreTargets.lean", "sha256": "5b066b89aa7939e5d37da8fbc48778e20119fe4ae0e8c91277b62183724d2cee" }, { "bytes": 4544, "path": "output/publication-scope-a-oct8/files/Gaps.lean", "sha256": "8ba9d1d44ad5c19bceea560734b271516e2fbb2032af4ba62875436090c1b30f" }, { "bytes": 4496, "path": "output/publication-scope-a-oct8/files/IncidenceMoments.lean", "sha256": "e91ba8ae5e2d5083ec5946a9a3da2907ebccdc209eb7a595098f44a494757021" }, { "bytes": 2817, "path": "output/publication-scope-a-oct8/files/IntegerMainBinding.lean", "sha256": "6a87d6209746e706bd2d44629f0333815b36a2f542d609ca8ff13f682d889e09" }, { "bytes": 13267, "path": "output/publication-scope-a-oct8/files/ManuscriptParameters.lean", "sha256": "927d7e627436e197b3b644bc13866bea4775b820eaa332af13966de0c40fce03" }, { "bytes": 9653, "path": "output/publication-scope-a-oct8/files/ManuscriptResidues.lean", "sha256": "a2ca43af4c608c303a7a2b1e61ca6b04677e636017937c3161e5c6fe1c272515" }, { "bytes": 21850, "path": "output/publication-scope-a-oct8/files/MertensBand.lean", "sha256": "6ee922c80814b35e0d47011a2bcb164e99467c85d190f92eb098ab8ba9be17d9" }, { "bytes": 3693, "path": "output/publication-scope-a-oct8/files/Normalization.lean", "sha256": "81662d512a792fc7530c6330859809ca715567c15190a0ef71998773c90106be" }, { "bytes": 4432, "path": "output/publication-scope-a-oct8/files/PrimaryMain.lean", "sha256": "cff1bb8609e7ca834419684da3c81bb8630f85a7730ea5b0dd3018f24504ed68" }, { "bytes": 7027, "path": "output/publication-scope-a-oct8/files/PrimeFactorial.lean", "sha256": "515c254617ee171c49108aa3509c8e7e3b98bdb0a7ff7d4703db97fd9bd8ecc4" }, { "bytes": 13299, "path": "output/publication-scope-a-oct8/files/PrimeLog.lean", "sha256": "8ef54f9d6fb8d484e2f9822ccd5ad063d93cf7141e8f1dc8c0bbc6d41022bd90" }, { "bytes": 8032, "path": "output/publication-scope-a-oct8/files/PrimePowerTail.lean", "sha256": "f496214b282b394abb5f0b5ded6c45a06eb17dab92095c56023e0728b5c4f2c8" }, { "bytes": 4468, "path": "output/publication-scope-a-oct8/files/PrimePsiBounds.lean", "sha256": "2f26fc0a8102841431a82579107d29d58ab33defaed2cbd98a8c5aa73a1d4219" }, { "bytes": 11928, "path": "output/publication-scope-a-oct8/files/PrimeReserveBudget.lean", "sha256": "1895d0e7ea7cc573477a2ca95f98d5f7b9ecde7b6330b230f4cc9e4afaf7e5ea" }, { "bytes": 10779, "path": "output/publication-scope-a-oct8/files/RealBand.lean", "sha256": "879496b2388f74b475fa7ac85918f76d58b3a9a671c64fbd9128b11cbebeac36" }, { "bytes": 8664, "path": "output/publication-scope-a-oct8/files/ReserveBudget.lean", "sha256": "dfaf920d927f70fdea77cf67290461f1235e20fd0234c91f3a2d897351a888c0" }, { "bytes": 1691, "path": "output/publication-scope-a-oct8/files/Reserved.lean", "sha256": "e6db9eb6ac6ddfbb7c0ca582c6ab11ef0392c0fa39b50d8b5e71c34434037847" }, { "bytes": 3828, "path": "output/publication-scope-a-oct8/files/ResidueMoment.lean", "sha256": "abd6a25cb565c497da27662b21a1fa1a1277dfadd05980910a716329168757a9" }, { "bytes": 9500, "path": "output/publication-scope-a-oct8/files/SelbergError.lean", "sha256": "3ee375547c7fd4acd5796f3f072be725abeba7d2f2f9b40cf73b3f7313c5402f" }, { "bytes": 10733, "path": "output/publication-scope-a-oct8/files/SelbergEuler.lean", "sha256": "a6e6cf8796eeb4e43a5351f90e932304632a819638c34202da04efb0e8da7d56" }, { "bytes": 10339, "path": "output/publication-scope-a-oct8/files/SelbergFinite.lean", "sha256": "8b10b2d4bc002b7dc6067b0b73197cf4715b0c3c7ca601025942c2ed84ec0177" }, { "bytes": 13767, "path": "output/publication-scope-a-oct8/files/ShiftedRankin.lean", "sha256": "3e0eaa6620c3c8dfb95771fc7fa2566fa10bc28f69954cf786e6485a838f5986" }, { "bytes": 7222, "path": "output/publication-scope-a-oct8/files/SieveCoarse.lean", "sha256": "8bc57801384e29fc3b6d53e4bec64cea1fb4f77865fdb36fb5b834e457ac5d03" }, { "bytes": 6760, "path": "output/publication-scope-a-oct8/files/SieveInterface.lean", "sha256": "ea07fcd56eb2688d70125f4b0ed11080554dc56821fd73489ab5683882384d73" }, { "bytes": 10211, "path": "output/publication-scope-a-oct8/files/SieveParameters.lean", "sha256": "f7d83b195e5748ef941f5d7a1c9fcd9b11ad99893bac45b9342e1d558939007b" }, { "bytes": 10322, "path": "output/publication-scope-a-oct8/files/SmoothBudget.lean", "sha256": "d69ec8f998d2c866e97eaeb92c7f7c3f237e642d919f52b99e6543dc47949bc2" }, { "bytes": 8336, "path": "output/publication-scope-a-oct8/files/SmoothLogLimit.lean", "sha256": "0f2f603ee9dd4764942eaddca94f211015ff1fba8737abe7dfddaca8f025a976" }, { "bytes": 16567, "path": "output/publication-scope-a-oct8/files/SmoothParameters.lean", "sha256": "0e231daeee4396300239389fcc537f9cd442ee88dcce3a5281d2ac7efeebcb2a" }, { "bytes": 5979, "path": "output/publication-scope-a-oct8/files/SmoothRankin.lean", "sha256": "3675eac4ebf6fca98e99e8cd1ee54bf133cbf45925f1e54f45f6d0df0fa79d53" } ], "model": { "actual_delegated_identity": "gpt-6.1-sol", "basis": "Explicit parent model selection and actual delegated context; this report is not a native-session transcript or independent model attestation.", "reasoning_effort": "high" }, "new_manuscript": { "binding_review": "INDEPENDENT_REVIEW_REQUIRED_FOR_CHANGED_BYTES", "bytes": 41786, "path": "manuscript.md", "sha256": "6c287c180b331318a19b3fb0a0e571147e01d785c4efa4341cf3bba5bd1c8e80" }, "open_original_obligations": [ { "gap": "The exact constant-plus-o(1) prime harmonic asymptotic is not proved. Section 5 uses elementary finite product bounds instead.", "id": "input-m8", "original_file_sha256": "50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521", "original_path": "original-manuscript-verbatim.md", "parts": [ { "end_line": 169, "start_line": 162, "utf8_sha256": "1d7e65dc185207f03fcb937fe6d607406915f833077eba0cfc68bde958b72ebf", "verbatim": "**Input M.** Mertens' prime harmonic estimate is\n$$\n \\sum_{p\\leq t}\\frac1p=\\log\\log t+M+o(1).\n \\tag{8}\n$$\nWe need only bounded errors and differences of this estimate, not a\nnumerically explicit error term. Its use is recorded in [R4, section 6.3]\nand in [KK, section 2]." } ], "status": "OPEN_FULL_PRINTED_STATEMENT", "title": "Mertens prime-harmonic asymptotic (original Eq. 8)" }, { "gap": "The two-variable uniform equality for every fixed positive epsilon, with Z and u both tending to infinity, remains open in this package. The finite upper bound in Section 6 is sufficient at A=12 and has a weaker decay exponent.", "id": "input-h9", "original_file_sha256": "50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521", "original_path": "original-manuscript-verbatim.md", "parts": [ { "end_line": 184, "start_line": 171, "utf8_sha256": "907546e48f9edd958ccb147bcf3ae9b04c0392c79c18622d0170ab66c5ffd5ec", "verbatim": "**Input H ([HT, Corollary 1.3, printed page 417]).** With\n$\\Psi(X,Z)$ counting integers at most $X$ all of whose prime factors\nare at most $Z$, put $u=\\log X/\\log Z$. For a fixed\n$\\varepsilon>0$,\n$$\n \\Psi(X,Z)=X u^{-(1+o(1))u}\n \\tag{9}\n$$\nas $Z,u\\to\\infty$, uniformly when $u\\leq Z^{1-\\varepsilon}$.\nThe formula and its range were read from the primary page image: this is\nthe printed range of Corollary 1.3 (p. 417). In $x,y$ the source restates\nthe underlying range (1.13) of its Theorem 1.2 as\n$(\\log x)^{1+\\varepsilon}\\leq y\\leq x$, (1.13)$'$ on p. 418.\nWe will use only its upper-bound consequence." } ], "status": "OPEN_FULL_PRINTED_STATEMENT", "title": "Uniform smooth-number asymptotic (original Eq. 9)" }, { "gap": "Quantified parameter limits underlying Eq.23 are proved for A>=4 with B=chooseB(A). The printed smooth equality and o(y/L) conclusion for every fixed A>4 in Eq.24 are not proved. The main theorem fixes A=12; its logarithmic shape is unchanged.", "id": "general-a24", "original_file_sha256": "50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521", "original_path": "original-manuscript-verbatim.md", "parts": [ { "end_line": 413, "start_line": 389, "utf8_sha256": "f6757c7e6a0816d635af83caeeb7444a03baaea59534cdeea53383da40dbbc88", "verbatim": "### 6.3 The smooth-number term\n\nSet $X=m+2$, $Z=z_1$. Then\n$$\n \\log X=L+O(L_2),\\qquad\n u=\\frac{\\log X}{\\log Z}\\sim\\frac{A L_2}{L_3}.\n \\tag{23}\n$$\nBoth $u$ and $Z$ tend to infinity. For example, with\n$\\varepsilon=1/2$, the range condition $u\\leq Z^{1-\\varepsilon}$\nholds eventually, because\n$\\log u=O(L_3)$ whereas\n$\\log Z=L L_3/(A L_2)$.\n\nMoreover $u\\log u=(A+o(1))L_2$. Input H therefore implies\n$$\n \\Psi(m+2,z_1)\n =(m+2)L^{-A+o(1)}\n =o(y/L)\\qquad(A>4).\n \\tag{24}\n$$\nFor the last step, the ratio to $y/L$ is bounded by a constant times\n$L^{4-A+o(1)}L_3^2/L_2^4$, which tends to zero.\nThis discharges the smooth-number range rather than assuming that a\nfixed-$u$ estimate applies while $u$ grows." } ], "status": "OPEN_FULL_PRINTED_STATEMENT", "title": "The arbitrary fixed A>4 route (original Eqs. 23–24)" }, { "gap": "The coefficient-1/2 asymptotic is not proved. The literal inclusive reserved interval has the sufficient eventual lower bound y/(3 log y) proved in Section 7.", "id": "input-p10", "original_file_sha256": "50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521", "original_path": "original-manuscript-verbatim.md", "parts": [ { "end_line": 192, "start_line": 186, "utf8_sha256": "44a8881a35b06ff0c92983887b3faed34c9746bb074ed51737edf53590d0a876", "verbatim": "**Input P.** The prime number theorem gives\n$$\n \\pi(y)-\\pi(y/2)\\sim\\frac{y}{2\\log y}.\n \\tag{10}\n$$\nNo explicit prime-count threshold is required. This is the final counting\ninput in [KK, section 2] and [R4, section 7]." } ], "status": "OPEN_FULL_PRINTED_STATEMENT", "title": "Dyadic prime-count asymptotic (original Eq. 10)" }, { "gap": "The full external Ford–Green–Konyagin–Maynard–Tao one-class theorem and the quoted arbitrary-kappa/multiplicative-g/nonnegative-weight sieve are not established here as those statements. Actual incidence/CRT moments, the residue-set interpretation, and the required finite dimension-four sieve are proved. The finite cover identity is also proved, and is not an open obligation.", "id": "context-and-sieve", "original_file_sha256": "50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521", "original_path": "original-manuscript-verbatim.md", "parts": [ { "end_line": 131, "start_line": 116, "utf8_sha256": "6de05644b2e3515a48124a36fc9aee41d6ffbe8945abd2320119cb4917ce2e62", "verbatim": "The same argument with one class per prime gives the usual Jacobsthal\ngap $g(P(y))$. Adding a second class cannot destroy a cover, so\n$$\n G_2(P(y))\\geq g(P(y)).\n \\tag{4}\n$$\nEquation (4) is elementary. Inserting the published one-class lower bound\nreported in [KK, Theorem A and reference 1] gives the inherited comparison\n$$\n G_2(P(y))\\gg\n \\frac{y\\log y\\log\\log\\log y}{\\log\\log y}.\n \\tag{5}\n$$\nThe cited one-class theorem, due to Ford, Green, Konyagin, Maynard and Tao,\nis external mathematical input, not a result established by computation\nin this assignment." }, { "end_line": 160, "start_line": 138, "utf8_sha256": "a6153c72450e3152fde93f14601a82ac21b7c15f02d6922c4012e8c4e2f4a49b", "verbatim": "**Input S ([KK, Lemma 1]).** Let $\\kappa$ be fixed. For primes $p\\leq z$,\nsuppose a multiplicative function $g$ satisfies\n$0\\leq g(p)\\leq\\kappa$ and $g(p)
X$.\n\nSince $D(n)\\mid P(z)$, it is coprime to $P(z)$ exactly when\n$D(n)=1$. Hence the left side of (7) is exactly $S(X,\\Omega)$.\nApplying Input S proves (11). $\\square$"
}
],
"status": "OPEN_FULL_PRINTED_STATEMENT",
"title": "External one-class comparison and the general quoted sieve (original Eqs. 5–7, 11)"
},
{
"gap": "The printed O(1) harmonic-density expansion and the two-sided Euler-product comparisons remain unproved as stated. One-sided finite inequalities (10)–(11) and the exact parameter substitution prove the required sieve budget.",
"id": "density20-21",
"original_file_sha256": "50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521",
"original_path": "original-manuscript-verbatim.md",
"parts": [
{
"end_line": 387,
"start_line": 355,
"utf8_sha256": "f97185f8f4981752964e66021b8b8a1424b0b3c0b089a46ec91bff2f0564e014",
"verbatim": "### 6.2 The product calculation\n\nThe two small primes contribute a bounded term, so Input M yields\n$$\n \\sum_{p\\leq\\sqrt y}\\frac{g(p)}p\n =2\\log\\log\\sqrt y+\n 2(\\log\\log z_1-\\log\\log z_0)+O(1).\n \\tag{20}\n$$\nThe contribution of the middle band is additional to the basic\ntwo-class contribution. Since $g(p)\\leq4$ and the small primes are\nhandled separately, the quadratic and higher terms in the logarithm\nof the product have bounded sum. It follows that\n$$\n V(\\sqrt y)\\asymp\n \\frac1{(\\log\\sqrt y)^2}\n \\left(\\frac{\\log z_0}{\\log z_1}\\right)^2\n \\asymp\n \\frac{A^4 L_2^4}{L^4L_3^2}.\n \\tag{21}\n$$\nThese are comparisons up to constant factors, not identities with unit\nconstant. In particular, exponentiating an $O(1)$ in (20) does not\nremove it.\n\nMultiplying (21) by (13) gives\n$$\n S(m,\\Omega)\\ll \\frac{A^4}{B}\\frac{y}{L}.\n \\tag{22}\n$$\nAfter fixing $A$, choose $B$ large enough that this term is at most\n$y/(4L)$ for all sufficiently large $y$. We have not assigned a\nnumerical value to the sieve constant."
}
],
"status": "OPEN_FULL_PRINTED_STATEMENT",
"title": "Original harmonic-density expansion and two-sided Euler-product comparisons (Eqs. 20–21)"
},
{
"gap": "The original m=floor(c y log y), z=sqrt(m) derivation, its (4 C c+o(1)) coefficient and quoted numerical pricing remain unproved. The original Eq.27 endpoint is actually proved by PrimaryMain.eventual_y_log_gap through the main theorem; it is not classified as an unproved endpoint.",
"id": "short-derivation28",
"original_file_sha256": "50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521",
"original_path": "original-manuscript-verbatim.md",
"parts": [
{
"end_line": 484,
"start_line": 455,
"utf8_sha256": "550c4f19a34987b7f762d58a1631c5e2fafdf4c5ca3567dbd5728b8b3d07a322",
"verbatim": "For completeness, let $m=\\lfloor c y\\log y\\rfloor$ and\n$z=\\sqrt m$, with $c>0$ fixed and sufficiently small.\nChoose $a_p=0$ for $p\\leq z$.\n\nLemma 2 with $\\kappa=2$, together with Mertens' theorem, bounds the\nuncovered indices by\n$$\n C\\,\\frac{m}{(\\log z)^2}\n \\leq (4Cc+o(1))\\,\\frac{y}{\\log y}.\n \\tag{28}\n$$\nHere the constant $C$ absorbs the convergent local factors, including\nthe prime 2. Since $z=o(y)$, the number of unused primes is\n$\\pi(y)-\\pi(z)\\sim y/\\log y$. Choosing $c<1/(8C)$ leaves more\nthan one unused prime per survivor, so the assignment in section 7\nfinishes the cover.\n\nIf that constant is priced at all, the cited form gives\n$C=2C_2e^{-2\\gamma}C_1=0.41621\\,C_1$ with $C_1(1/2)=805.5$\n($\\delta=0.05$, $K=3$), so any $0