OFFSET
1,2
FORMULA
Conjecture: a(p) = (p-1)*(p+1) for prime p.
From Robert Israel, Dec 19 2019: (Start)
The conjecture is true. In fact for T in GL(2,Z(p)), the order of T divides p*(p-1) if the characteristic polynomial of T splits over Z(p) and p^2-1 if it doesn't; moreover, if T is the companion matrix of the minimal polynomial of a primitive element of GF(p^2), the order is p^2-1.
a(p^k) <= (p^2-1) p^(k-1).
If m and n are coprime, a(m*n) <= a(m)*a(n). (End)
PROG
(GAP) Concatenation([1], List([2..10], n->Maximum(List(GL(2, Integers mod n), Order))));
(PARI)
MatOrder(M)={my(id=matid(#M), k=1, N=M); while(N<>id, k++; N=N*M); k}
a(n)={my(m=0); for(a=0, n-1, for(b=0, n-1, for(c=0, n-1, for(d=0, n-1, my(M=Mod([a, b; c, d], n)); if(gcd(lift(matdet(M)), n)==1, m=max(m, MatOrder(M))))))); m}
CROSSREFS
KEYWORD
nonn
AUTHOR
Andrew Howroyd, Jul 06 2018
STATUS
approved
