1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:

static int[] wilson(int n){
    BigInteger fak = BigInteger.ONE;
    int[] terms = new int[n-1];
    int count = 0;

    for(int m=2; m<=n; m++){
      fak = fak.multiply(BigInteger.valueOf(m-1));
      if(fak.add(BigInteger.ONE).mod(BigInteger.valueOf(m)).compareTo(BigInteger.ZERO)==0){
        terms[m-2] = 1;
        count++;
      }
    }

    int[] primes = new int[count];
    count = 0;
    
    for(int i=0; i<n-1; i++){
      if(terms[i]==1){
        primes[count] = i+2;
        count++;
      }
    }
    
    return primes;
  }