Abstract Algebra
Let n ≥ 2. Show that Sn is generated by each of the
following sets.
(a) S1 = {(1, 2), (1, 2, 3), (1, 2, 3, 4), ..., (1,
2, 3,..., n)}
(b) S2 = {(1, 2, 3, ..., n-1), (1, 2, 3, ..., n)}
2. Let D be a relation on the natural numbers N defined by D =
{(m,n) : m | n} (i.e., D(m,n) is true when n is divisible by m. For
this problem, you’ll be proving that D is a partial order. This
means that you’ll need to prove that it is reflexive,
anti-symmetric, and transitive.
(a) Prove that D is reflexive. (Yes, you already did this problem
on one of the minihomework assignments. You don’t have to redo the...
Prove that there exists integers m and n such that 15m + 12n =
3
Please do not prove by assuming m=1 and n=-1, I'd like to prove
by not assuming any actual numbers.