Euler's constant

I found an interesting tweet. This is expanding, and you find pattern so it must be a good tool for AI.

σ(n) is sum of divisors and n is infinite.

(n> 5040)

If you find it, you can disprove the Riemann Hypothesis.

p is the i-th prime number.

---

ex.

30=2*3*5
900=(2^2)*(3^2)*(5^2)=30^2
27000=(2^3)*(3^3)*(5^3)=30^3

・
・

30^α=(2^α)*(3^α)*(5^α)

α=1,2,3,4・・・・

---

Therefore, you can see this.

Φ is multiplication of infinite prime numbers.
I define that multiplication of fractal is still fractal.

---

n=5050=2*(5^2)*101
σ(5050)=1+2+5+10+25+50+101+202+505+1010+2525+5050=9486=X
5050 ln(ln 5050)≒10823.43=Y
X/Y≒0.8764