Sequence of Smallest Consecutive Composite Numbers longer than 100

Theorem

The $1$st prime gap greater than $100$ is between $370 \, 261$ and $370 \, 373$, of length $112$.

That is, the sequence of the smallest consecutive composite positive integers longer than $100$ is that of $111$ such, from $370 \, 262$ to $370 \, 372$.

Proof

This theorem requires a proof. In particular: Brute force? You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Sources

• July 1994: Rex Watson: Runs of Composite Integers and the Chinese Remainder Theorem (The Mathematical Gazette Vol. 78, no. 482: pp. 167 – 172)  www.jstor.org/stable/3618573

• 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $111$