Saturday, April 22, 2017

discrete mathematics - Proof of divisibility by 2 and 3 if and only if divisible by 6

I can't find a way of proving that:




For integer a, a is divisible by 2 and divisible by 3 if and only if a is divisible by 6.





I’m not sure where to go from here. Any help would be great!

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...