status: DONE
created: 2023-12-23T02:12
updated: 2024-06-11T01:14
discrete-mathematics-assignment-6
a)
b)
c)
There are only 3 situations z=2,1,0
when
when
when
a)
b)
c)
d)
c:
d: if n = m The number of bijections from a set A with n elements to a set B with m elements is
if n
$\therefore $ It can't be an injection function
Suppose the length of the string is n
Suppose that