I came up with this algorithm (pic related) today and thought I'd share. It's an algorithm that factors a factor of two primes. While it does not work on all primes, it seems to have increased accuracy when the primes are closer, and when the primes are consecutive or 2-3 primes apart (and at least two digits), it seems always work, even when the factor is in the billions of trillions it gets instantly calculated when I type it into the computer. If n is the square of a prime, it won't work. Regardless I believe this formula is pretty cool and I'm sure with a little tweaking by people much smarter than me it might become much more accurate and render RSA broken.