Abstract Algebra - Natural Numbers Proof

adamsmc2
Messages
2
Reaction score
0
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!
 
Physics news on Phys.org
I think you are on the right track. Note that you happened to choose two co-prime 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?
 
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.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top