Ravi has a shortcut for spotting primes: "If an odd number greater than 1 is not divisible by 3, 5, 7 or 11, then it is prime." He tests every odd number up to 160, finds no failure, and says his shortcut is proved.
(i) Find the smallest counterexample to Ravi's shortcut.
(ii) Explain what his testing up to 160 did and did not show.
