RE: Random Thoughts
July 6, 2018 at 11:14 pm
(This post was last modified: July 6, 2018 at 11:14 pm by Kernel Sohcahtoa.)
I just gained a deeper understanding of the following lemma: if 2^m + 1 is prime, then m=2^n for some integer n ≥ 0. Yesterday, the author's proof wasn't entirely clicking for me; however, when I came back to it today and decided to write it out and do a good analysis of it (rather than be a spectator and read it), I could see the beauty of his contrapositive approach and definitely appreciated the lemma and its proof much more.