Built a program to break RSA encryption when the public modulus N is generated incorrectly from generating the first prime p by choosing a random number R and scanning for a prime close by and the second prime q generated by scanning for another random prime also close to R.
