In the residual the Euler prime is
ProvedOddPerfectNumber.Kernel.five_euler_prime_is_five_mod_forty_eightSuppose the two-prime residual has already forced for some , as the proved theorem five_euler_index_is_six_times_square establishes from . Then together with the Euler-prime hypothesis one obtains the much sharper restriction
Indeed forces odd, so is odd, and an odd square is modulo . Hence , i.e. .
Consequence. This upgrades the earlier parity-only conclusion to a congruence modulo , and it is the first point at which the square structure of the linear cyclotomic factor feeds back into the Euler prime itself. Two further consequences follow immediately and are recorded as separate targets: gives and , which through the proved allocation and transfer to and hence, with the mod- transfer, . Verified exhaustively for every prime with and : 25 cases, no counterexample.
namespace OddPerfectNumber.Kernel
/-- If `p % 4 = 1` and `p + 1 = 6 * u ^ 2` for some `u`, then `p % 48 = 5`.
From `p % 4 = 1` we get `u ^ 2` odd, hence `u` odd, and every odd square is `1 (mod 8)`.
So `p + 1 = 6 * u ^ 2 = 6 (mod 48)`, giving `p = 5 (mod 48)`. -/
theorem five_euler_prime_is_five_mod_forty_eight (p u : Nat) (hp4 : p % 4 = 1)
(hshape : p + 1 = 6 * u ^ 2) :
p % 48 = 5 := by
sorry
end OddPerfectNumber.Kernel