paridroid
 

As is well known pari is a number-theory software. Its android version is paridroid.
In the above { is = Mod(n, p)^(p-1) = = 1} does not work when the divisor is complex or a quadratic algebraic integer. Fortunately this difficulty can be overcome by the following:
step 1: create a special ring by Mod(x,x^2 + 7)
step 2: {is (n) = Mod(%1.prime(n))^(prime(n)-1) = = 1}
step 2: select (is,[1..10])

Must acknowledge Charles's tips in the above algorithm.