# Fungrim entry: 75231e

$g_{p} = \min \left\{ a : a \in \mathbb{Z}_{\ge 1} \,\mathbin{\operatorname{and}}\, \# \left\{ {a}^{k} \bmod p : k \in \mathbb{Z}_{\ge 0} \right\} = p - 1 \,\mathbin{\operatorname{and}}\, \# \left\{ {a}^{k} \bmod {p}^{2} : k \in \mathbb{Z}_{\ge 0} \right\} = p \left(p - 1\right) \right\}$
Assumptions:$p \in \mathbb{P} \,\mathbin{\operatorname{and}}\, p \ge 3$
TeX:
g_{p} = \min \left\{ a : a \in \mathbb{Z}_{\ge 1} \,\mathbin{\operatorname{and}}\, \# \left\{ {a}^{k} \bmod p : k \in \mathbb{Z}_{\ge 0} \right\} = p - 1 \,\mathbin{\operatorname{and}}\, \# \left\{ {a}^{k} \bmod {p}^{2} : k \in \mathbb{Z}_{\ge 0} \right\} = p \left(p - 1\right) \right\}

p \in \mathbb{P} \,\mathbin{\operatorname{and}}\, p \ge 3
Definitions:
Fungrim symbol Notation Short description
ConreyGenerator$g_{p}$ Conrey generator
Minimum$\mathop{\min}\limits_{P\left(x\right)} f\!\left(x\right)$ Minimum value of a set or function
SetBuilder$\left\{ f\!\left(x\right) : P\!\left(x\right) \right\}$ Set comprehension
ZZGreaterEqual$\mathbb{Z}_{\ge n}$ Integers greater than or equal to n
Cardinality$\# S$ Set cardinality
Pow${a}^{b}$ Power
PP$\mathbb{P}$ Prime numbers
Source code for this entry:
Entry(ID("75231e"),
Formula(Equal(ConreyGenerator(p), Minimum(SetBuilder(a, a, And(Element(a, ZZGreaterEqual(1)), Equal(Cardinality(SetBuilder(Mod(Pow(a, k), p), k, Element(k, ZZGreaterEqual(0)))), Sub(p, 1)), Equal(Cardinality(SetBuilder(Mod(Pow(a, k), Pow(p, 2)), k, Element(k, ZZGreaterEqual(0)))), Mul(p, Sub(p, 1)))))))),
Variables(p),
Assumptions(And(Element(p, PP), GreaterEqual(p, 3))))

## Topics using this entry

Copyright (C) Fredrik Johansson and contributors. Fungrim is provided under the MIT license. The source code is on GitHub.

2019-08-17 11:32:46.829430 UTC