funky function!

A has n distinct elements.find no. of distinct functions from A to A

i m getting answer as nn.is it correct??

9 Answers

1
terror s ·

isnt it

nC1 * nC1 = n2 ?

1
hacker ·

oye i don't have answer but clearly n2 is wronggggg

1
ajoy abcd ·

It should be n!

1
gordo ·

yeah heavenonearth [woah!], thats right, if many one functions are allowed.
each element has n choices to choose one of them.
so n^n
cheers!!

1
hacker ·

give solution ajoy not answer!

1
gordo ·

ok. try these ones.
1) total number of increasing functions
2) non decreasing functions

[for the ones who havn't solved these]

1
heavenonearth20 ·

well gordo i used same logic but answer from a IIT-B professor is n!

1
gordo ·

see HOE, if many one mappings are allowed, then each element has n choices to make it nn. but if 'distinct' doesnot include many one mappings, then we arrange n elements in n places in n! ways. so the answer depends on what exactly u want.
is this from kdjoshi??
btw, do try the other problems also.
cheers!!

1
heavenonearth20 ·

ha!ha!IIT-B ke professor K>D>JOSHI :)

Your Answer

Close [X]