Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2005 / Problems / Day 1, P6

IMC 2005 · Day 1 · P6

killer

Given a group GG, denote by G(m)G(m) the subgroup generated by the mmth powers of elements of GG. If G(m)G(m) and G(n)G(n) are commutative, prove that G(gcd(m,n))G(\gcd(m, n)) is also commutative. (gcd(m,n)\gcd(m, n) denotes the greatest common divisor of mm and nn.)

Solution (official)

Write d=gcd(m,n)d = \gcd(m, n). It is easy to see that G(m),G(n)=G(d)\langle G(m), G(n) \rangle = G(d); hence, it will suffice to check commutativity for any two elements in G(m)G(n)G(m) \cup G(n), and so for any two generators ama^m and bnb^n. Consider their commutator z=ambnambnz = a^{-m} b^{-n} a^m b^n; then the relations z=(ambam)nbn=am(bnabn)mz = (a^{-m} b a^m)^{-n} b^n = a^{-m} (b^{-n} a b^n)^m show that zG(m)G(n)z \in G(m) \cap G(n). But then zz is in the center of G(d)G(d). Now, from the relation ambn=bnamza^m b^n = b^n a^m z, it easily follows by induction that amlbnl=bnlamlzl2.a^{ml} b^{nl} = b^{nl} a^{ml} z^{l^2}. Setting l=m/dl = m/d and l=n/dl = n/d we obtain z(m/d)2=z(n/d)2=ez^{(m/d)^2} = z^{(n/d)^2} = e, but this implies that z=ez = e as well.

How the field did

contestants scored
226
average (of 20)
0.43
solved (≥ 80%)
0.0%
near-0 (≤ 10%)
93.8%
discrimination
0.26

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2012 · Day 2 · P10killeravg 0.0/10 · solved 0% · near-0 100% · disc 0.16
IMC 2008 · Day 1 · P5killeravg 0.1/10 · solved 1% · near-0 98% · disc 0.22
IMC 2020 · Day 2 · P7very hardavg 0.8/10 · solved 6% · near-0 91% · disc 0.48
IMC 2010 · Day 2 · P8very hardavg 1.2/10 · solved 7% · near-0 85% · disc 0.40