The prime number theorem states that the number of primes not exceeding N is approximately N= lnN. Thus the number of primes is relatively dense compared to nonprimes. Therefore for generation of p and q we may adopt the following strategy: test the prime p with some primality test and then choose q close to p with same primality tests. This ensures that p and q are about the same size. Can you use this method to generate primes for RSA crypto-system ? Motivate your answer.