Gapplet

Given a prime number n N and an element g Z/nZ, test if g is primitive.

Input a prime number n 
 
Input an integer g 
representing a candidate generator
 
decide whether g is primitive