News for hackers. Stuff that matters.
Re:Math Bite: Irrationality of √m (1999) by jfarmer on Thursday December 24, 2015 @11:47PM (#10790446)
No, it follows directly from the fact that the positive integers are well-ordered, i.e., any set of positive integers has a least element.

And in case one is tempted to think that well-ordering and divisibility are somehow equivalent, consider Presburger arithmetic[1]. It's not even possible to define a general notion of divisibility or primality in that context, but I'm almost positive the well-ordering principle holds (it's equivalent to the axiom schema of induction).

[1]: https://en.wikipedia.org/wiki/Presburger_arithmetic

Re:Math Bite: Irrationality of √m (1999) by brlewis on Monday December 28, 2015 @02:37PM (#10802895)
alpha = p/q where p and q are positive integers.

It's finding the set of all possible q that uses divisibility, not finding the least member of that set.