Timeline for Finite groups with elements of order n
Current License: CC BY-SA 2.5
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 15, 2010 at 5:34 | vote | accept | falagar | ||
Jul 14, 2010 at 9:36 | comment | added | Yemon Choi | @Benoit: de rien. | |
Jul 14, 2010 at 9:21 | comment | added | Benoît Kloeckner | @Yemon Choi: you are right, of course, sorry. | |
Jul 14, 2010 at 8:39 | comment | added | Yemon Choi | Victor: fair enough. It is a natural enough question, after all. I personally wish that more questions on MO gave more detail as to who the questioner is, why they are interested, and what they already know or don't know; but I appreciate that people will have good reasons for wanting to be vague. | |
Jul 14, 2010 at 8:23 | history | edited | Victor Protsak | CC BY-SA 2.5 |
rearranged
|
Jul 14, 2010 at 8:19 | comment | added | Victor Protsak | Yemon: Regardless of OP's intentions, his/her question admits a precise mathematical answer. I am very cautious not to give away answers to problems or projects that someone should think over themselves, but I firmly believe in indicating to that person the right theory or tools. | |
Jul 14, 2010 at 6:58 | comment | added | Yemon Choi | Benoit: as remarked above, if every non-identity element has order $n$, then $n$ has to be prime; so I think the distinction you allude to disappears, no? | |
Jul 14, 2010 at 6:56 | comment | added | Benoît Kloeckner | It seems to me that the question is about group all of whose non trivial elements have order equal to $n$, not at most $n$. | |
Jul 14, 2010 at 6:48 | comment | added | Yemon Choi | I was going to mention the restricted Burnside problem earlier, but I wasn't sure if it was what the original questioner was looking for, or indeed if he or she was being led up to rediscovering parts of it by a third party. | |
Jul 14, 2010 at 6:25 | history | answered | Victor Protsak | CC BY-SA 2.5 |