Say I am presented with a group, e.g the integers ${1,2,3,4}$ under multiplication modulo 5. How would I go about identifying all of the characters? (I happen to know, due to availability of answers, that the characters in this case are: $$f(1) = f(2) = f(3) = f(4) = 1$$ $$f(1) = f(4) = 1; f(2) = f(3) = -1$$ $$f(1) = 1; f(2) = i; f(3) = -i; f(4) = -1$$ $$f(1) = 1; f(2) = -i; f(3) = i; f(4) = -1$$
My question is, how were those generated? And more generically, given some finite, abelian group G', is there a method to at least somewhat systematically generate its characters? Or is the approach simple brute force/inspection?