RSA Factorization problem

Posted by dada on Stack Overflow See other posts from Stack Overflow or by dada
Published on 2010-04-15T15:59:20Z Indexed on 2010/04/15 16:03 UTC
Read the original article Hit count: 315

At class we found this programming problem, and currently, we have no idea how to solve it.

The positive integer n is given. It is known that n = p * q, where p and q are primes, p<=q and |q-k*p|<10^5 for some given positive integer k. You must find p and q.

Input:

35 1
121 1
1000730021 9

Output:

5 * 7
11 * 11
10007 * 100003

It's not a homework, we are just trying to solve some interesting problems. If you have some ideas, please post them here so we can try something, thanks.

© Stack Overflow or respective owner

Related posts about rsa

Related posts about factorisation