f(f(a,b), c) = f(a, f(b, c)) y is also injective Therefore, 9 is bijecti b) Given a bijection f: Ax AA (as in part a), present a short recursive argument to prove for each n there is a bijection between A" (the Cartesian product of n copies of the set A), and the set A itself. f: A-A is given