PrimitiveRoot

Available

Finds the smallest primitive root modulo n.

Forms

PrimitiveRoot[n]

PrimitiveRoot[n, k]

Verified examplesPrimitiveRoot[7] → 3

Run this on Qurak Search the reference

Used in

Powers of a primitive root - 2 steps

Topics

Cryptographic Number Theory - Key Generation
New In60 Alphabetical Listing - P
New In60 Mathematical Functions - New Integer & Number Theory Functions »
New In60 Mathematics And Algorithms - New in Number Theory & Integer Functions »
New In60 Number Theory And Integer Functions - New Divisibility-Related Functions
Number Theoretic Functions - Congruences

Related

PrimitiveRootList MultiplicativeOrder EulerPhi CarmichaelLambda PowerMod DirichletCharacter ChineseRemainder Mod PowerModList CoprimeQ Divisible IntegerLength

All 6300 functions · Use this from an MCP client