<p>If g is a generator in U(m), what is the order g^k? (Let n = |U(m)|)</p>
<p>If g is a person who posts inappropriately, what do we do in order to let g know that g is posting in the wrong place?</p>
<p>not helpful</p>
<p>no? .</p>
<p>Obviously your not capable of understanding something this complicated…</p>
<p>Well this isn’t really the right place to be asking math questions… try AoPS.</p>
<p>i cant even find that in my AoPS book.</p>
<p>Sounds like PROMYS (or Ross) problem sets. Ahh those were… fun? :)</p>
<p>I don’t know much about group theory, but the Wikipedia article ([Cyclic</a> group - Wikipedia, the free encyclopedia](<a href=“http://en.wikipedia.org/wiki/Cyclic_group]Cyclic”>Cyclic group - Wikipedia)) might be helpful, particularly:</p>
<p>“As a practical problem, one may be given a finite subgroup C of order n, generated by an element g, and asked to find the size m of the subgroup generated by gk for some integer k. Here m will be the smallest integer > 0 such that mk is divisible by n. It is therefore n/m where m = (k, n) is the greatest common divisor of k and n. Put another way, the index of the subgroup generated by gk is m.”</p>
<p>
my mind is simple enough to understand you posted in the wrong place.</p>
<p>This is for PROMYS</p>
<p>Do you not see that the forum says: “Massichusetts Institute Of Technology”?</p>
<p>But of course, the math nerds would be at the college admissions forum rather than the math forum [Index</a> page • Art of Problem Solving](<a href=“http://www.artofproblemsolving.com/Forum/index.php?]Index”>http://www.artofproblemsolving.com/Forum/index.php?)</p>
<p>resilient, I gotta say, your post #2 is pretty dou chy</p>
<p>Simmer down.</p>
<p>NUMBER THEORY FIGHT!</p>
<p>My Mersenne Prime will kick your rear end!</p>
<p>Can’t you see? All of you who couldn’t address his question are just “not capable of understanding something [that] complicated.” It’s not because this is the wrong forum, but because you’re all just too stupid.</p>