flâneur

Combinatorics Solved Problems

probabilitycourse.com · 1,223 words · saved by 1 readers

Examples with solutions

--> Combinatorics Solved Problems HOME VIDEOS CALCULATOR COMMENTS COURSES FOR INSTRUCTOR LOG IN FOR INSTRUCTORS Sign In Email: Password: Forgot password? ← previous next → 2.1.5 Solved Problems: Combinatorics Problem Let $A$ and $B$ be two finite sets, with $|A|=m$ and $|B|=n$. How many distinct functions (mappings) can you define from set $A$ to set $B$, $f:A \rightarrow B$? Solution We can solve this problem using the multiplication principle. Let $$A =\{a_1,a_2,a_3,...,a_m\},$$ $$B =\{b_1,b_2,b_3,...,b_n\}.$$ Note that to define a mapping from $A$ to $B$, we have $n$ options for $

related reading