Paper IX visual guide · Visual 5 of 23

The final rank-four congruence

Start reading

Resources & source

Original section in the visual-guide PDF · Original visual source

Skip contents and start reading

For \(n\ge0\), \(k\ge1\), and \(H\ge1\), the actual Euler coefficients satisfy

\[ \sum_{i=0}^k(-1)^{k-i}\binom ki E_{4(n+iH)}^{(4,j)} \equiv0\pmod {2^{\,v_2(k!)+k v_2(H)+A_j(k)}}, \]

where

\[ \begin{aligned} A_0(k)=A_1(k)&=k,\\ A_2(k)&=\max\{k+4,\ 2k+\lfloor k/2\rfloor+1\},\\ A_3(k)&=k+2. \end{aligned} \]
Original Euler congruence exponents at unit step
Original figure from the retained vector PDF.

Reading the figure

The horizontal axis is difference order, one through thirty-two; height is bits of divisibility for the original Euler coefficients. Addresses zero and one share an exact curve. Address three has a proved lower bound. Address two has the larger lower bound, with exactness marked at powers of two. The table uses the recorded theorem-derived arrays.

Recorded theorem-derived unit-step exponents
OrderAddresses 0 and 1 (exact)Address 2 (lower bound)Address 3 (lower bound)
1153
2375
3496
47149
581610
6102012
7112213
8152817
9163018
10183420
11193621
12224124
13234325
14254727
15264928
16315633
17325834
18346236
19356437
20386940
21397141
22417543
23427744
24468348
25478549
26498951
27509152
28539655
29549856
305610258
315710459
326311265
Selectable labels from the original PDF

Native PDF text retains the figure’s extraction order. Equations and data tables above provide the reading order.

1
4
8 16 24 32
difference order k
0
20
40
60
80
100
120
bits of divisibility for the original Euler coefficient
j = 0, 1: exact
j = 3: proved lower bound
j = 2: proved lower bound
j = 2: exact at powers of two

Original vector figure PDF · Full-size image

Original figure caption

The exponent of the final Euler congruence at unit step. The address zero and one curve is exact at every order. Marked address-two orders are universally exact; the other displayed address-two and address-three values are proved lower bounds.

At a common step with \(v_2(H)=s\), add \(ks\) to every displayed exponent. Thus a doubling of the step gains one additional bit per difference, rather than one bit for the whole expression.

This statement combines two different proved bounds at address two. A lower bound is not automatically an exact valuation: divisibility may be stronger at unmarked orders or at particular starting rows.

Source and conversion record

The full edition has 23 sections and 20 figures, including eight worked examples. The older visual README describes 15 sections and 12 figures. Original wording, equations and finite-check scope are retained. Descriptions and data tables are reading aids. This conversion renders existing figure PDFs without rebuilding TeX, running the mathematical generators, auditing proofs or compiling Lean.

Source hashes and conversion checks

Notation in Paper IX

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index