Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internal
f n=mod(until((<1).mod n)(+1)2^n)n<1 36 bytes
f n=and[mod(gcd d n^n)n<2|d<-[1..n]] 39 bytes
f n=all((`elem`[1,n]).gcd n.(^n))[2..n] 39 bytes
f n=mod n(n-sum[1|1<-gcd n<$>[1..n]])<1 40 bytes
f n=and[mod(p^n)n<1|p<-[2..n],mod n p<1] f n=mod(until((<1).mod n)(+1)2^n)n<1 39 bytes
f n=all((`elem`[1,n]).gcd n.(^n))[2..n] 39 bytes
f n=mod n(n-sum[1|1<-gcd n<$>[1..n]])<1 40 bytes
f n=and[mod(p^n)n<1|p<-[2..n],mod n p<1] f n=mod(until((<1).mod n)(+1)2^n)n<1 36 bytes
f n=and[mod(gcd d n^n)n<2|d<-[1..n]] 39 bytes
f n=all((`elem`[1,n]).gcd n.(^n))[2..n] 39 bytes
f n=mod n(n-sum[1|1<-gcd n<$>[1..n]])<1 40 bytes
f n=and[mod(p^n)n<1|p<-[2..n],mod n p<1] f n=mod(until((<1).mod n)(+1)2^n)n<1 39 bytes
f n=all((`elem`[1,n]).gcd n.(^n))[2..n] 39 bytes
f n=mod n(n-sum[1|1<-gcd n<$>[1..n]])<1 40 bytes
f n=and[mod(p^n)n<1|p<-[2..n],mod n p<1] f n=mod(until((<1).mod n)(+1)2^n)n<1 39 bytes
f n=all((`elem`[1,n]).gcd n.(^n))[2..n] 39 bytes
f n=mod n(n-sum[1|1<-gcd n<$>[1..n]])<1 f n=mod(until((<1).mod n)(+1)2^n)n<1 39 bytes
f n=all((`elem`[1,n]).gcd n.(^n))[2..n] 39 bytes
f n=mod n(n-sum[1|1<-gcd n<$>[1..n]])<1 40 bytes
f n=and[mod(p^n)n<1|p<-[2..n],mod n p<1] f n=mod(until((<1).mod n)(+1)2^n)n<1 39 bytes
f n=all((`elem`[1,n]).gcd n.(^n))[2..n] 39 bytes
f n=mod n(n-sum[1|1<-gcd n<$>[1..n]])<1