The above remark applies also to many composite numbers which are not Carmichael numbers, but which are still not shown to be composite by Fermat's theorem for a specific base a. […] Therefore, using Euler's criterion or a strong primality test with enough bases will finally reveal any composite number or, alternatively, prove the primality of any prime N.

An oft-told tale

The palsie plagues my pulses when I prigg yoͬ: piggs or pullen your culuers take, or matchles make your Chanticleare or sullen

[The hill] commanded a wide stretch of links or downs, met by the blue girdle of the Frith, having for its fringe, all along the coast, clusters of ancient villages—fishing or trading—with red-tiled or blue-slated houses, and round-belfried or sharp-pointed steeples of parish kirks.