Showing S = ℤ Using 13 & 1000 in Subring

  • Thread starter Thread starter Bachelier
  • Start date Start date
  • Tags Tags
    Stuck
Bachelier
Messages
375
Reaction score
0
Let S be a subring of the ring of integers ℤ. Show that if 13 ∈ S and 1000 ∈ S, then S equals ℤ.

I'm thinking we should construct a bijection using both numbers. Any ideas? thanks
 
Physics news on Phys.org
I see that ∃ no takers. I know the problem looks weird but it is a problem I read in an old paper.

The only thing I can think of is that we need to show that 1 ∈ S. To do this I can use 12 ∈ S because 12 = 1000 - 13*76, therefore 13 - 12 ∈ S and hence S has an identity and therefore we can extend to Z.
 
Bachelier said:
Let S be a subring of the ring of integers ℤ. Show that if 13 ∈ S and 1000 ∈ S, then S equals ℤ.

I'm thinking we should construct a bijection using both numbers. Any ideas? thanks

13 and 1000 are relatively prime so 1 is in the subring that they generate.
 
Thank you Lavinia. You're becoming my favorite Science adviser. :)
 
##\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