Amicable Pair with Smallest Common Prime Factor 5

Theorem
An amicable pair whose smallest common prime factor is greater than $3$ has the elements:
 * $m_1 = 5 \times 7^2 \times 11^2 \times 13 \times 17 \times 19^3 \times 23 \times 37 \times 181 \times 101 \times 8693 \times 19 \, 479 \, 382 \, 229$

and:
 * $m_2 = 5 \times 7^2 \times 11^2 \times 13 \times 17 \times 19^3 \times 23 \times 37 \times 181 \times 365 \, 147 \times 47 \, 307 \, 071 \, 129$

This was at one point the smallest known counterexample to the observation that:
 * most amicable pairs consist of even integers
 * most of the rest, whose elements are odd, have both elements divisible by $3$.

Proof
It is to be demonstrated that these numbers are amicable.

From Divisor Sum of Integer:
 * $\ds \map {\sigma_1} n = \prod_{1 \mathop \le i \mathop \le r} \frac {p_i^{k_i + 1} - 1} {p_i - 1}$

where:
 * $\ds n = \prod_{1 \mathop \le i \mathop \le r} p_i^{k_i} = p_1^{k_1} p_2^{k_2} \cdots p_r^{k_r}$

is the prime decomposition of $n$.

When $k_i = 1$ the individual factor becomes $\dfrac {p_i^2 - 1} {p_i - 1} = \dfrac {\paren {p_i + 1} \paren {p_i - 1} } {p_i - 1} = p_i + 1$.

We establish the contributions to the divisor sum values of $m_1$ and $m_2$ by taking the prime factors in turn, and extracting the prime factors of each result.

First, the elements common to both:

This gives a common factor of both $\sigma_1$ values of:

The remaining prime factors of $m_1$:

The remaining prime factors of $m_2$:

and so:

It remains to be shown that:
 * $\map {\sigma_1} {m_1} = \map {\sigma_1} {m_2} = m_1 + m_2$

So: