Let f:2S→R be a function defined on the subsets of a finite set S. Prove that if f(A)=F(S\A) and max{f(A),f(B)}≥f(A∪B) for all subsets A,B of S, then f assumes at most ∣S∣ distinct values. Miklos Schweitzerfunctionset theoryreal analysiscollege contests