[…] when Di looked at his pinched and pale face in this placid condition, the tears would overflow their natural boundary, and sobs would rise up in her pretty throat, but she choked them back for fear of disturbing her boy.

It is not hard to prove that the only way that the number 1+2ᵉ can possibly be prime is when e is a power of 2, and so all Fermat primes must have the form 1+2 for integers a>0. The numbers F_a=1+2 are called Fermat numbers, and although it is true that every Fermat prime is a Fermat number, it is certainly not true that every Fermat number is prime.

Far easier to not use warts in the first place. Even if a wart is present, you still have to verify the variable's declaration anyway, if you're a diligent maintenance programmer.

"What do you suppose I cared whether I waked you or not, you blunderhead.