Number of One-to-One Functions | Counting | Injective Function | Discrete Mathematics

In this video, we count how many one to one functions are there from set A to set B with size of A as m and size of B as n. We start with recalling what an injective function or one-to-one function is , and proceed with an example showing how to count such functions and goes to generalized version.

[@danielstockley5631]

Thank you brother. As usual, a youtube video is more clear and concise than university material lol.

[@othmaneleboss9276]

you are incredible my brother!

[@Gamma3]

Thank you a lot. I will suscribe

[@karthikkantennanavar5603]

Thanks sir.. Really helpful sir

[@gamecentral4072]

Tysm ❤️☺️

[@lulu-xp7mf]

thank you

[@jiminsyougotnojams5532]

Thankss a lott

[@jamjam3448]

Indo indo 😂😂😂. Thanks though

[@hamdielsaddik2074]

what happens if for example f(1) can't equal a

[@JohnyCarrot]

Than its not a function, because all preimages must have some image. If not, than its not a function

[@shahinam7543]

Indo 😆😆😆 sir it's into

[@jamjam3448]

😂 😂 😂 😂 Hahahah 🤣 😂 🤣 😂