Talk:Multiplicative order
From Wikipedia, the free encyclopedia
[edit] Merge with Primitive root modulo n
Primitive root modulo n is a terrible page title; a redirect to 'primitive root' would be good. --Charles Matthews 17:02, 30 Oct 2003 (UTC)
- Anything explicitly wrong with Primitive element? Just checking :) --Dysprosia 19:06, 30 Oct 2003 (UTC)
-
- Yes - primitive element needs disambiguation because there is another, more prominent use in field theory. The primitive element theorem states that if L is a finite separable field extension of K, then L = K(t) for some t in L; such t, generating L from K, are also called primitive elements. --Charles Matthews 09:17, 31 Oct 2003 (UTC)
-
-
- Ah, yes, thanks for reminding me :) I'll go disambiggy-it now, if it hasn't been done --Dysprosia 09:19, 31 Oct 2003 (UTC)
-
-
-
-
- Let's perhaps not merge this, the term has a bit more specific meaning and treatment in relation to number theory than it has in group theory in general. Dysprosia 03:29, 31 December 2005 (UTC)
-
-
[edit] Merge with Order_(number_theory)
It is just me, or do this page and Order_(number_theory) cover the exact same thing? I vote we merge Order_(number_theory) here, because it's smaller. --Culix (talk) 21:16, 22 April 2008 (UTC)
- I believe the order of an element can be defined more generally than just for integers modulo n. Because of that I think “Order (number theory)” is a better name for the page – assuming it will at some point gain more content.
- Multiplicative order is also a little misleading because for example take the operation of the integers coprime to n, modulo n, to be defined as multiplication of integers, and everything currently in Order (group theory) applies. GromXXVII (talk) 23:00, 22 April 2008 (UTC)