Register to reply 
Abstract Algebra  Natural Numbers Proof 
Share this thread: 
#1
Jan2213, 09:03 PM

P: 2

The question is which sets of natural numbers are closed under addition. I know that odd is not, and I know how to prove that sets of multiples are, but my professor said there is something more and that is has to do with greatest common divisor. He said to pick numbers like 3 and 5 or 5 and 8, then expand the set.
For example 3,5 would be {3,5,6,8,9,10,11,12,13,14,15,....} He said we should be able to observe over multiple sets something that is not completely obvious but I can't see anything. Possibly it has something to also do with the Euclidian Algorithm but I'm not so sure about that. Also, he said something about when the set starts to show regularity. Any insight will help. Thanks! 


#2
Jan2313, 02:26 AM

Sci Advisor
HW Helper
P: 4,300

I think you are on the right track. Note that you happened to choose two coprime numbers. Do you see how at some point, you start to get all numbers (10, 11, 12, ...)?
Given 3 and 5, if you perform the Euclidean Algorithm, that basically gives you ... what? 


#3
Jan2313, 03:23 AM

HW Helper
P: 2,264

Let n be any natural number
If a is in the set a*n must be If a and b are in the set, gcd(a,b)*n is, if n is large enough. 


Register to reply 
Related Discussions  
Natural Numbers Proof?  Linear & Abstract Algebra  5  
Abstract Algebra Question dealing with Constructible Numbers  Calculus & Beyond Homework  0  
Abstract algebra proof involving prime numbers  Calculus & Beyond Homework  3  
Natural numbers proof help  Calculus & Beyond Homework  2  
Proof for k natural numbers  Set Theory, Logic, Probability, Statistics  22 