The GCD forms a subgroup of the integers

In summary: This is done by showing that a+b=r+(n1+n2)+s+(m1+m2), which is true for n1+n2, m1+m2 since they are both integers.
  • #1
jmjlt88
96
0
Let r and s be positive integers. Show that {nr + ms | n,m ε Z} is a subgroup of Z

Proof: ---- "SKETCH" -----

Let r , s be positive integers. Consider the set {nr + ms | n,m ε Z}. We wish to show that this set is a subgroup of Z.

Closure

Let a , b ε {nr + ms | n,m ε Z}. Then, a = n1r1 + m1s1 and b = n2r2 + m2s2. Computing a + b (since we are considering Z under additon?), we get

a + b = n1r1 + m1s1 + n2r2 + m2s2.

... All of these elements are integers and our result will again be an integer, and hence a+b will be in our set.

Identity

If we take n,m = 0, we will have 0 ε {nr + ms | n,m ε Z}... Thus, the identity exists.

Inverses
Let a = nr + ms. Take a-1= -nr+-ms since -n,-m ε Z
... Hence, inverses exist our set.

QED


Any huge mistakes?
 
Physics news on Phys.org
  • #2
For closure, you need to show a+b is in the set, not that it's an integer. Also, there's only one r and one s, so there's no need for subscripts on them.
 
  • #3
Vela, so I have to show that a+b can be written as nr + ms for some integers n,m?

The sum a+b = r (n1 + n2) + s (m1+m2)

Then, n1 + n2 and m1+m2 are both integers. Let n1 + n2= n' and m1+m2=m'.

Thus,

a + b = rn' + sm' for n' , m' ε Z and our set is closed.

How this? :) Thanks for your help!
 
  • #4
Looks good.

All you need to show is closure and that the set contains inverses for its elements to prove it's a subgroup. From those two, it follows that the identity is in the set, and associativity is inherited from the group.

The other approach is to show if a and b are in the set, that a-b is in the set.
 

What is the GCD?

The GCD, or greatest common divisor, is the largest positive integer that divides evenly into two or more numbers.

What is a subgroup?

A subgroup is a subset of a larger group that still follows the same operation rules as the larger group.

How is the GCD calculated?

The GCD can be calculated using various methods such as Euclid's algorithm or prime factorization. These methods involve finding the common factors of the given numbers and identifying the largest one.

Why is the GCD important?

The GCD is important in various mathematical applications, such as simplifying fractions, finding equivalent ratios, and solving problems in number theory and algebra.

How does the GCD form a subgroup of the integers?

The GCD forms a subgroup of the integers because it follows the same operation rules as the integers. For any two integers, the GCD will always be a positive integer, and it is closed under addition and multiplication.

Similar threads

  • Calculus and Beyond Homework Help
Replies
20
Views
2K
  • Calculus and Beyond Homework Help
Replies
2
Views
964
  • Calculus and Beyond Homework Help
Replies
13
Views
2K
  • Calculus and Beyond Homework Help
Replies
7
Views
2K
  • Calculus and Beyond Homework Help
Replies
30
Views
2K
  • Calculus and Beyond Homework Help
Replies
2
Views
278
  • Calculus and Beyond Homework Help
Replies
5
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
521
  • Calculus and Beyond Homework Help
Replies
1
Views
580
  • Calculus and Beyond Homework Help
Replies
4
Views
1K
Back
Top