
#1
Aug207, 05:09 AM

P: 23

This is for a proof but I was generally more curious so it isn't in the homework section.
If I were to make a set A which is defined as all the prime factors of an integer a there could be some numbers in A which are repeated, would these count as distinct members or not? The reason why I was wondering is if I made another set by the same criteria for an integer b would and then I made another set C with members A cap B would the repeated numbers show up only as many times as they appear in the set that contains them least or most? I think it should be least but I don't have text on the subject yet and we haven't covered much set theory. I would also appreciate some link or recommendation for a text at 1st year university level. 



#2
Aug207, 08:31 AM

P: 90

A way to approach the problem is to consider the concept of multiset. Here's a link that should help.
http://en.wikipedia.org/wiki/Multiset 



#3
Aug207, 09:16 AM

P: 23

Thanks a lot, that has just the properties I needed for the proof.



Register to reply 
Related Discussions  
Prime factorization, Exponents  Precalculus Mathematics Homework  1  
Prime Factorization Time Complexity  Engineering, Comp Sci, & Technology Homework  3  
Prime factorization  Linear & Abstract Algebra  2  
Help with prime factorization proof  Linear & Abstract Algebra  9  
Random Prime Factorization  General Math  20 