Two primes were chosen p 463258741983258799 and q 58965417

Two primes were chosen p = 463258741983258799 and q = 589654173654089659 to form a product n = pq. crypto professor wants to demonstrate the Pollard p - 1.algorithm. which use a parameter B successfully factor n? What is the smallest good B and what is the largest good B?

Solution

p = 4.6 10^17;

q = 5.896 10^17;

largest good B will be

6 10^17;

and smallest good B will be 4.8 10^17;