OFFSET
1,3
LINKS
EXAMPLE
For n = 2, q = prime(2) = 3, we have (q-1)#=2, then the multiplicative order of q modulo (q-1)# is 1.
MAPLE
with(NumberTheory):
primorial := proc(n::integer)
local total := 1:
local count := 2;
for count from 2 to n do
if isprime(count) then
total *= count
endif;
end:
return total;
end proc:
numberOfTerms := 3;
List := [seq(MultiplicativeOrder(ithprime(i), primorial(ithprime[i]-1)), i=1..numberOfTerms)]
MATHEMATICA
a[n_] := MultiplicativeOrder[Prime[n], Times @@ Prime[Range[n-1]]];
a /@ Range[30] (* Jean-François Alcover, Nov 03 2020 *)
PROG
(PARI) a(n)={znorder(Mod(prime(n), vecprod(primes(n-1))))} \\ Andrew Howroyd, Sep 05 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Yassine Lagrida, Sep 04 2020
EXTENSIONS
Terms a(16) and beyond from Andrew Howroyd, Sep 05 2020
STATUS
approved