#a procedure that inputs an integer p and outpus #true or false according to whether #Fermat's little theorem holds for it #it should give true if the input p is a prime number #For example, F(17); F:=proc(p) local i: evalb({seq(evalb(i^p mod p=i),i=0..p-1)}={true}) : end: