| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 21 Mar 2008 13:13:19 IST
|
|
|
The way people have solved my doubts I am really thankful to them
This must also be simple!
The number of maps f from the set {1,2,3} into the set { 1,2,3,4,5} such that f(i)  f(j)
whenever i < j , is
a.) < 50 b.) 35
c.) 50 d.) 60
|
|
|
|
21 Mar 2008 16:46:16 IST
|
|
|
So many geniuses please see this too.
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|
|
|
easy first put f(3) = 5. Then put f(2)=5 implies f(1) has 5 ways Put f(2) = 4 f(1) = 4ways So by pattern get sigma(5) Next time get sigma(4)... So ans is 15+10+6+3+1 = 35 :)
|
this reply: 5 points
(with 1
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
21 Mar 2008 17:34:22 IST
|
|
|
Important thing is to note the pattern :)
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
21 Mar 2008 18:22:59 IST
|
|
|
sandeep/madness thts jus simple recurrence mate..wat big 'pattern'
thts an obvious pattern.. :p
|
Nitwit Blubber Odment Tweak
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
21 Mar 2008 18:24:14 IST
|
|
|
where did i say that the pattern was tough or sth? Its ofc easy :D :D
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
21 Mar 2008 18:25:00 IST
|
|
|
thank you , you are correct !
Got your solution..
Thanks for the tip too.
|
this reply: 5 points
(with 1
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|
Moderation Team
![[Up]](/templates/default/images/icon_up.gif "[Up]"){kind=icon}
