5 ms·
> I don't, I know a proof but none including (3 . q - 2 . p). It's weird. I'm still looking at it. It would be nice to have an explanation here by someone that
by gus_massa 8y ago
> I don't, I know a proof but none including (3 . q - 2 . p).
It's weird. I'm still looking at it. It would be nice to have an explanation here by someone that is a Coq specialist.
Anyway, in a google search found this other proof that uses that
> The last digit of the square of any positive integer written in base 3 can not be 2. [near a reference to Robert Gauntt]
http://www.mathpath.org/proof/sqrt2.irrat.htm http://www.mathpath.org/proof/sqrt2.irrat.htm
I'm not sure that it is related, but the 3q-2p and 3p-4q look like something that can be related to base 3.
It looks like the base 3 proof doesn't use the Fundamental Theorem of Arithmetic, that is a very powerful result and I'm not sure if they have already a formal demonstration of that in Coq.