Prove that |A × B| = |A| × |B| for finite sets A, B.
What should be the base case for this?
ALso, for the inductive step, if I take |A|=m and |B|=n, then should I take |A|=m+1 and |B|=n+1 and prove it using induction?
Prove that |A × B| = |A| × |B| for finite sets A, B.
What should be the base case for this?
ALso, for the inductive step, if I take |A|=m and |B|=n, then should I take |A|=m+1 and |B|=n+1 and prove it using induction?
Copyright © 2021 JogjaFile Inc.
Prove this by induction on $n$:
And the base case is of course for $n=0$.