User talk:Alercher

Thank you, Jianhui67, for restoring the edit I made to the page, "Euclid's Theorem." I was only clarifying how Euclid's own proof does not need to use an inference from contradiction, even though even knowledgeable people sometimes ignore this distinction. Saying that the proof checks a finite list states the proof in such a way that modern computer-oriented people can easily see how the proof works. There is nothing contradictory about being a divisor of 1. But this property does not apply to any integer. By the way, I am a fan of Furstenberg's proof of the same theorem. It is a proof by contradiction. I'm not dogmatically in favor of constructive proof. But is it good to see the difference. Alercher (talk) 16:25, 22 September 2016 (UTC)