Create a BigInteger number n that is at least 100 bits long.  Modify the code presented in text to use BigInteger rather than long and then list and count all the pseudo primes between n and n+1000.  Look for 20 witnesses before concluding a number is "pseudo prime"