[GAP Forum] about computing with integers mod n in GAP

[Siddhartha Sarkar]

Dear forum,

I am trying to compute representations of elements in the finite ring of
integers modulo n with given coefficients as powers of a given unit say k
mod n. The coefficients need to be from some small interval of integers say
[-t, t] (t is positive integer less than [n/2] so that t stays unique mod
n).

I was trying to find out list of all available commands in GAP which
include finding multiplicative order of k mod n. Are there some list of all
commands related to these?

The online documentation of ZmodnZ doesn't have much information.

Thanks,
Siddhartha