+65 I was messing around with modulos and I came across a certain equation. However, when I saw the values for y=2, I was blown away. They seemed to be all the prime numbers. However, I don't know how to prove it works for all primes. If one of you could post a proof that would be amazing :D
EQUATION: \(mod(2^{round(x)},round(x))\) (seems like values output two if they are prime)
