I wonder if #27 is supposed to be proven without Fermat's Little Theorem. (The question is if p is an odd prime, then 2^{p-1} = pk + 1 for some integer k). Since p does not divide k, it follows from Fermat's Little Theorem that p | (2^{p-1} - 1).