Tuesday, October 30, 2018

divisibility - Number theory problem divides

In class today we were talking about proving the definition of 'divides' and the teacher never got to finish this proof.





if a divides b^2 , then a divides b.




First line was:
Let a and b be integers. a > 0 since you cant divide by 0. If a divides b^2, then there exists an integer q such that b^2 = aq. I would assume the next lines may be trying to show that b^2 is a product of some integer and itself and then that integer can always be divisible by the same q? Not sure here..

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...