I need a little help with combinatorics. 2 Students have 6 dollar notes worth 500 dollars, and 4 notes worth 1000 dollars. Notes with the same value are not distinguished. A-How many ways to split the notes B-How many ways to split the notes, so that both get an equal amount of notes. C-How many ways to split the notes, so that both get an equal amount of money. D- How many ways to split the notes if we distinguish the notes among each other. And another: There is given a set M with m elements and set N with n elements and function f:M->N A- How many diferent bijective functions exist when m=n? B- How many diferent injective functions exist when m<=n? C- how many diferent surjective functions exist when m>=n? thx!