// フェルマーの小定理の確認
// m^(p-1) = 1 mod p for prime p. 
import java.math.BigInteger;
import java.util.Random;
public class Fermat2
{ public static void main (String[] args) 
    { BigInteger One = new BigInteger("1");
      BigInteger p = new BigInteger(50, 20, new Random());
      BigInteger m, p1, q;
      m = One;
      p1 = p.subtract(One);
      System.out.println("p="+p.toString());
      for (int k=2; k<=10; k++)
        { m = m.add(One);
//  q=m^p1 mod p
          q = m.modPow(p1, p);
          System.out.println("m="+m.toString()+"  m^(p-1)="+q.toString());          
        }
    }
}