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)
| This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
| |||||||||||
| The content of Order (number theory) was merged into Multiplicative order on February 11, 2011. The former page's history now serves to provide attribution for that content in the latter page, and it must not be deleted as long as the latter page exists. For the discussion at that location, see its talk page. |
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)
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)
A fun fact that could perhaps go in the examples section is that: ord2n+1(n) describes the number of shuffles needed to return to the initial state when shuffling, for example, poker chips with n blue chips in the left hand and n or n+1 red chips in the right hand or a deck of cards (see https://en.wikipedia.org/wiki/Shuffling#Riffle). This can be easily understood if we label the positions of each chip from 1 to 2n (blue being 1 to n, red being n+1 to 2n), shuffling then corresponds to the transformation shuffle(i)=mod(2i,2n+1) so that the condition to return to equilibrium is the number of shuffles needed to have an identity operator, i.e. ord2n+1(n). From the integer series (https://oeis.org/A002326) we can see directly that shuffling with for example 31 chips on each side requires only 6 shuffles to get back to the initial situation. --Jaapkroe (talk) 14:56, 17 March 2014 (UTC)
Multiplicative suborder redirects here, but is not defined. While we're at, suborder function should get a mention, too. Paradoctor (talk) 21:13, 3 February 2020 (UTC)
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.