and sum operation by mod3.
Denote S subset of X.
1)if a,b belong to S then -(a+b) doesn't belong to S;//-(1,2) = (2,1)
2)if a,b,c belong to S then a+b+c=0:
I must write a programm wich will find the count of S for specific n:
this is a np problem:
From 1) and 2) I understand that if I already got A I don't consider -A:
I want to to find solution of this problem and optimize it and need your help.
thank's for any advice