Show that . so . Now and . So show that there is some common element which implies that they must be equal?
Follow Math Help Forum on Facebook and Google+
Originally Posted by Sampras Show that . so . Now and . So show that there is some common element which implies that they must be equal? I think you meant Let me prove the following for you if and then we have = Now mn|LHS of the equation above. Hence the result. In this case , so Hence the result
Originally Posted by aman_cc I think you meant Let me prove the following for you if and then we have = Now mn|LHS of the equation above. Hence the result. In this case , so Hence the result Can you use fact that either is disjoint or equal? Thus show that if there is some element in then ? Thus ?
Sorry - but unable to follow you question completely.
Originally Posted by aman_cc I think you meant Let me prove the following for you if and then we have = Now mn|LHS of the equation above. Hence the result. In this case , so Hence the result How does this show the result?
Originally Posted by Sampras How does this show the result? Hi - Maybe I am not getting your question, but here is the logic I have used. We have proved if m|x and n|x then => mn|x So let 1. x in (m) and x in (n) => x in (mn) 2. x in (mn) => x in (m) and x in (n) Hence Essentially all I am saying is
Last edited by aman_cc; Oct 14th 2009 at 06:16 AM. Reason: latex tag error
View Tag Cloud