LetAandBbe finite sets of cardinalitynandmrespectively, wherenandmare positive natural numbers.

Show, using induction onn, that there aremfunctions from^{n}AtoB.

Would i be ok to use base step as n = 1? for a function A -> B for one in A

A (x) mapping to B (a1,a2,a3.... am)

The number of functions possible for n-1 is m^n

I don't know how to go on with the induction step. Any ideas?

## Bookmarks