input mod then primitive root
37
3
3 is 3 ^ 1 (mod 37)
9 is 3 ^ 2 (mod 37)
27 is 3 ^ 3 (mod 37)
7 is 3 ^ 4 (mod 37)
21 is 3 ^ 5 (mod 37)
26 is 3 ^ 6 (mod 37)
4 is 3 ^ 7 (mod 37)
12 is 3 ^ 8 (mod 37)
36 is 3 ^ 9 (mod 37)
34 is 3 ^ 10 (mod 37)
28 is 3 ^ 11 (mod 37)
10 is 3 ^ 12 (mod 37)
30 is 3 ^ 13 (mod 37)
16 is 3 ^ 14 (mod 37)
11 is 3 ^ 15 (mod 37)
33 is 3 ^ 16 (mod 37)
25 is 3 ^ 17 (mod 37)


#!/usr/bin/perl -w
print "input mod then primitive root\n";
my $modulo = <STDIN>;
my $proot = <STDIN>;
chomp($modulo);
chomp($proot);
my $answer = $proot % $modulo;
my $count = 1;
while ($answer > 1)
{
	print "$answer is $proot ^ $count (mod $modulo) \n";
	$answer = ($answer * $proot) % $modulo;
	$count++;
	
}