Efficient way to find which element of Z*n has largest order?

  • Thread starter Thread starter dumbQuestion
  • Start date Start date
  • Tags Tags
    Element
Click For Summary
The discussion focuses on the conditions under which the multiplicative group of integers mod n, denoted Z*(n), is cyclic and how to identify its generators. It is established that Z*(n) is cyclic if n is 1, 2, 4, or of the form pk or 2pk for an odd prime p. The conversation highlights the complexity of determining when Z*(n) is not cyclic, particularly for composite numbers with multiple prime factors. Additionally, participants seek efficient methods for finding generators in cyclic groups and the element with the highest order in non-cyclic groups, indicating that this topic may involve deeper mathematical inquiries. Overall, the need for further study and resources in number theory is emphasized.
dumbQuestion
Messages
124
Reaction score
0
Hey, I had two separate questions. (When I say Z*(n) I'm denoting the multiplicative group of integers mod n, namely, the units of Z(n))

First off, I know that if n is prime, that Z*(n) is cyclic. But this is not a biconditional statement. Is there any theorem which tells me conditions under which Z*(n) is not cyclic? I can't just say n is not prime so Z*(n) is not cyclic. Right?

Second question - if I know that Z*(n) is cyclic, then I know it has a generator. But other than going through each and every element and multiplying them out, is there an efficient way to find out which elements are generators? Also, in the case that Z*(n) isn't cyclic (like say Z*(12)) is there a way to find which element has the highest order?

If anyone can point me to the proper theorems, I would be extremely grateful!
 
Physics news on Phys.org
Start by thinking about the case where n = pq where p and q are both prime. (For example, n = 6)

When you see what is going on, generailze it to the case where n has more than two prime factors.
 
Aleph Zero makes a good suggestion. It is not so trivial in general however, when there are repeated factors. There is a discussion starting on p. 48. of these notes, of when the group is cyclic:

http://www.math.uga.edu/%7Eroy/844-2.pdf

In fact your question as to precisely how to identify generators is perhaps even less trivial. There may even be some open questions surrounding that matter, as I recall.
 
Last edited by a moderator:
Thank you guys for the links and the responses!

I also found this:

"Zn*, the multiplicative group modulo n, is cyclic if and only if n is 1 or 2 or 4 or pk or 2pk for an odd prime number p and k ≥ 1."

But I did not see a proof provided for it. I think this might tie in with what you were saying AlephZero
 
if you look at the links i provided you will find complete proofs of these facts.
 
Yeah I have spent the last couple hours looking at the doc you provided and some other documents I've hunted down. Very helpful! I need to purchase a good number theory textbook to have on hand it seems! Thank you again!
 
I am studying the mathematical formalism behind non-commutative geometry approach to quantum gravity. I was reading about Hopf algebras and their Drinfeld twist with a specific example of the Moyal-Weyl twist defined as F=exp(-iλ/2θ^(μν)∂_μ⊗∂_ν) where λ is a constant parametar and θ antisymmetric constant tensor. {∂_μ} is the basis of the tangent vector space over the underlying spacetime Now, from my understanding the enveloping algebra which appears in the definition of the Hopf algebra...

Similar threads

  • · Replies 5 ·
Replies
5
Views
4K
Replies
2
Views
3K
  • · Replies 5 ·
Replies
5
Views
936
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 26 ·
Replies
26
Views
847
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 17 ·
Replies
17
Views
6K
  • · Replies 16 ·
Replies
16
Views
5K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
6
Views
4K