User talk:Michael Underwood

[User bio is in User:Your Name]

Welcome

You can find some more information about our collaboration groups if you follow this link CZ:Workgroups.You can always ask me on my talk page or others about how to proceed or any other question you might have.

Kind Regards, Robert Tito |  Talk  17:59, 6 May 2007 (CDT)

Euclid's lemma

$a{\frac {b}{p}}=n\ ,$

and since gcd(a, p) = 1 and n is an integer, b/p must also be an integer

I'm afraid you've lost me. How can you draw this conclusion without assuming either Euclid's lemma or uniqueness of prime factorization (the first of which certainly involves circular reasoning and is thus a logical fallacy, and the secdon of which is vulnerable to the same danger since Euclid's lemma is often used for proving uniqueness of factorization)? Michael Hardy 20:37, 3 August 2007 (CDT)