public static boolean esPrimo

import java.math.BigInteger;
 
public class Factorial {
 
 public static BigInteger uno = new BigInteger("1");
 
 public static BigInteger recursivo(BigInteger n) {
 if(!n.toString().equals("0"))
 return n.multiply(recursivo(n.subtract(uno)));
 else
 return uno;
 
 }
 
 public static BigInteger iterativo(long n) {
 BigInteger factorial = uno;
 long i = 2;
 while(i < n){
 factorial = factorial.multiply(new BigInteger(""+i));
 i++;
 }
 return factorial;
 }
 
 public static void main(String args[]) {
 long i = 1;
 while(i < 100000) {
 System.out.println(i+ ":\t"+iterativo(i));
 i++;
 }
 
 }
 
}
 
 

 
import java.io.FileReader; 
import java.io.BufferedReader; 
import java.math.BigInteger; 
import java.util.StringTokenizer; 
 
public class Problem1 { 
 
 public static void main(String args[]) throws Exception { 
 BufferedReader in = new BufferedReader(new FileReader("q1.txt")); 
 StringTokenizer st; 
 BigInteger a, p, m, n,pm; 
 int i; 
 while(in.ready()) { 
 st = new StringTokenizer(in.readLine()); 
 a = new BigInteger(st.nextToken()); 
 p = new BigInteger(st.nextToken()); 
 m = new BigInteger(st.nextToken()); 
 n = new BigInteger(st.nextToken()); 
 System.out.println("a = "+ a); 
 System.out.println("p = "+ p); 
 System.out.println("m = "+ m); 
 System.out.println("n = "+ n); 
 i = 1; 
 pm = new BigInteger(p.toString()); 
 
 while(i < m.intValue()) { 
 System.out.println("pass: " + i); 
 pm = pm.pow(p.intValue()); 
 i++; 
 } 
 System.out.println("p^p m veces = "+ pm); 
 System.out.println("Resultado: "+a.modPow(pm,n)); 
 } 
 } 
}

3 3 1 5
3 3 2 5
3 3 3 5
47 47 1 67
47 47 2 67
47 47 3 67
32719 54323 99 65399