The 7,392,637 Composite Number Pattern

One disclosed construction using 3, 7, 37, and 73

Formal status: TBP-289 — 1 composite requirement
This is one documented requirement within the current total of 290.

Counting disclosure: The former page listed 17 patterns. Most were properties of one selected number or later consequences of that selection. They are now grouped as one composite requirement. Verse associations and locations reported from searches within the digits of e are supporting observations, not separate statistically independent patterns.

The central construction

7392637

The number begins with 73, ends with 37, and places the three-digit number 926 between the reversed prime pair. Its central arithmetic is:

7,392,637 = 7 × 17 × 23 × 37 × 73

7,392,637 ÷ (37 × 73) = 2,737

Directly verified properties

Property	Verification
Digit sum	7 + 3 + 9 + 2 + 6 + 3 + 7 = 37
Prime-pair divisibility	Evenly divisible by both 37 and 73.
Additional displayed factors	Evenly divisible by 7, 17, and 23.
Middle five digits	3 + 9 + 2 + 6 + 3 = 23
Outer structure	Seven digits; begins and ends with 7; the next-to-outer digits are both 3.
Quotient structure	7,392,637 ÷ 2,701 = 2,737

These statements are all reproducible arithmetic, but they are related consequences of choosing the same number and are not counted independently.

What `number.java` tests

The supplied number.java constructs candidate numbers in the form 73 + interior + 37. For the default interior range 1 through 999, it applies the disclosed divisibility and digit-sum conditions. It then repeats an analogous—but not perfectly symmetrical—search using 52 and 25 as the secular control pair.

Default search	Reported and independently checked result
37/73 construction, interior 1–999	73 + 926 + 37 = 7,392,637 is the one output.
25/52 construction, interior 1–999	No output satisfies all of the program's conditions.

The control is informative as a disclosed program result, but it is not fully symmetrical: a number ending in 25 is automatically divisible by 25, whereas a number ending in 37 is not automatically divisible by 37.

The number 926 and its square root

The square root begins:

√926 = 30.4302481094058777968…

If the two integer digits are included in the digit positions, the three-digit window centered on position 17 is 777. Because this indexing convention must be stated, the observation is retained as a supporting feature rather than a separate requirement.

The earlier claim that 926 is the only number below 5,000 having a comparable square-root feature is removed because the supplied programs do not perform or document that search.

Reported searches in the first billion digits of e

The supplied e.java downloads a frozen decimal expansion of e, searches for 7,392,637 and its reverse 7,362,937, and filters occurrence positions for separated 37 and 73 strings. The retained console output is:

7392637 found at 357335037 in e
407352376 37

The second number after the reverse-search position is its digit sum. These results were reported from the original run; the billion-digit archive itself was not supplied during this audit, so the complete digit search was not independently rerun.

Reported position	Verified arithmetic about the position
357335037	Can be displayed as 35·73·350·37; division by 73 leaves remainder 37; it is evenly divisible by 27.
407352376	Contains separated 73 and 37; its digits sum to 37.

Removing 73 and 37 from the first position leaves 35350, not literally 35:35. Interpreting it as 35:35 requires treating the zero as insignificant; that interpretive step is disclosed and is not counted.

Related verse associations

The middle number 926 suggests Psalm 92:6:

Psalm 92:6: “A brutish man knoweth not; neither doth a fool understand this.”

The forward e-position was interpreted as suggesting Exodus 35:35 after removing selected 37/73 strings and disregarding a zero:

Exodus 35:35: “Them hath he filled with wisdom of heart, to work all manner of work, of the engraver, and of the cunning workman, and of the embroiderer… and of those that devise cunning work.”

These verse connections are meaningful interpretations made after the numerical results were known. They are not treated as independently predicted outcomes or assigned separate probabilities.

Corrections and boundaries

No claim of uniqueness “to infinity” is made. A bounded computer search cannot establish that.
The former assertion about all numbers below ten trillion is removed because no retained run specification or output establishes that exact range.
The earlier one-in-25-billion probability is removed because it multiplies dependent and post-selected observations.
The 153 result from add.java is valid but belongs to the Genesis value-plus-place work and is not counted in this Number collection.
The occurrence positions in e, their internal digit strings, and the verse associations are all downstream of selecting 7,392,637.

Formal requirement

For this category, a comparison sentence must satisfy the single disclosed composite test adopted in the final challenge rules. Any secular 25/52 comparison must use the same stated construction, interior range, digit-sum rules, divisibility rules, and indexing conventions. The entire package counts once regardless of how many consequences are displayed.

Reproducibility files: number.java · e.java · add.java