double posted by mistake...
This is my version of the definition of primitive root:
a is a primitive root mod m iff the order of a mod m is equal to phi(m) (where the order of a mod m is the smallest positive integer h such that a^h is congruent to 1 mod m.)
But from here I really don't see how we can get b1=g^n (mod p)...