News for hackers. Stuff that matters.
Re:Math Bite: Irrationality of √m (1999) by fluxion on Wednesday December 23, 2015 @01:30PM (#10784774)
Not necessarily. Strictly mathematically a (non-negative) fraction q/p is just the equivalence class of all non-negative integer pairs (s, t), t != 0, such that

qt = sp

As such we may make q as small as possible by finding a representative in the equivalence class where the numerator is smallest (using the well ordering principle of the of the natural numbers). You can identify this pair uniquely (when the fraction is not 0) by using divisibility but that isn't required here.

Re:Math Bite: Irrationality of √m (1999) by brlewis on Wednesday December 23, 2015 @03:54PM (#10785575)
By the same reasoning, divisibility does not use divisibility. Instead of asking if x is divisible by y you create a set of all products of the form ny where n is an integer, then check to see if x is a member of that set.

I don't buy it. qt = sp looks too much like x = ny to me.