Talk:Positive Integer Greater than 1 has a Prime Divisor

This is an obvious corollary of the Fundamental Theorem of Arithmetic, which I've already provided a proof for. I don't think a proof of this is necessary.

I agree that it follows fairly trivially, but that doesn't mean that we shouldn't put up a proof. After all, not everything here has to be a difficult calculus proof, some should probably be things that anyone can understand.--cynic 23:29, 12 July 2008 (UTC)

On second thought, maybe this is a little too trivial. What do others think?--cynic 23:33, 12 July 2008 (UTC)

We can always put up both?--Joe 02:55, 13 July 2008 (UTC)

As I try to deal with as many stub articles as I can, it seems to me that there is nothing that should be added to this article. Therefore I removed the stub tag, even though it is a short article. If others disagree, or if you believe this page should be totally removed, feel free to post here.

Keep it in, I say. If you start making decisions now as to what does or does not consist of a "big enough" proof to put on the site, you'll be potentially limiting it arbitrarily. We can always go back and tidy up later when we have a sufficient body of material to be able to make those sorts of decisions. My view is: let's just bang in all the stuff we know, for now, the more the merrier. --Matt Westwood 05:28, 27 August 2008 (UTC)