Python/Diffie-Hellman/Chinese remainder theorem

1. Using the Chinese remainder theorem, explain what the problem is with using a nonprime parameter in Diffie-Hellman.

2. p = 143319364394905942617148968085785991039146683740268996579566827015580969124702493833109074343879894586653465192222251909074832038151585448034731101690454685781999248641772509287801359980318348021809541131200479989220793925941518568143721972993251823166164933334796625008174851430377966394594186901123322297453 

The parameter had suffered from a transcription error, e.g., there is a prime that differs from in one decimal digit and this was what was intended. Write code to find all such primes. (Do not allow substituting a 0 for the leading digit.)

3. Repeat 3c but with binary digits instead of decimal digits.