Ex. 1.23 Modified Search for Primes
Ex. 1.27 how Carmichael numbers fools fast-prime

The test data and results of evaluation are appended in comments after
the script finishes.
My first attempt at the Miller-Rabin modification

The fermat-test procedure fails because the expmod statements, in the
nested conditional, do not evaluate to a value (nested under the 'even?'
conditional). This is because the procedure attempts to check an
un-computed expression against '1' and '(- m 1)' fail. However, the
sequence of checks appears to be correct. Must find some other way to do
this.
Correct square checking logic

Gave up after going in circles for two days with this exercise. Fixed it
after looking at Bill the Lizard's solution:
http://www.billthelizard.com/2010/03/sicp-exercise-128-miller-rabin-test.html

The general idea was correct, but application of the logic was wrong
wrong wrong.