Experiment with increasing sizes of [ScriptP] and [ScriptQ] to make the modulus factor that is very hard for Mathematica to factor. In your experiment, take primes of increasing number of digits (you can use successive applications of the NextPrime command) and measure how long you must wait for the result of factor (FactorInteger). Extrapolate from these timings a save size for the values of [ScriptP] and [ScriptQ]. Justify your choice of size, referring to the algorithm to factor a natural number [ScriptN] : try all divisors from 2 to the square root of [ScriptN].