| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 10 May 2007 00:25:48 IST
|
|
|
Hey girls!!!!! Wanna Solve this!!!!!!!!!
How many distinct neckless can be formed using n identical diamonds and k identical pearls?????????????
|
Ken
From: UNITED STATES, Green Bay, Wisconsin
 |
|
|
|
10 May 2007 00:33:14 IST
|
|
|
Dude i'm not a girl but think have got ur soln.
total diamond n pearls = n + k
as they r identical so no. of ways = n+kCn * kCk
= n+kCn * 1 = n+kCk
pls rate me if its correct
|
 
Being beaten is often a temporary condition, giving up is what makes it permanent. |
this reply: 5 points
(with 1 
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
10 May 2007 00:54:11 IST
|
|
|
raman recheck. how can n> n+k. in nCr , n is greater than r.
|
this reply: 5 points
(with 1
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
10 May 2007 01:00:13 IST
|
|
|
i think it's (n+1)(k+1).
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
10 May 2007 09:57:37 IST
|
|
|
sry i have crrected dat
|
Being beaten is often a temporary condition, giving up is what makes it permanent. |
this reply: 5 points
(with 1
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
10 May 2007 11:10:19 IST
|
|
|
is it
(2^n)(2^k) - 1
|
     
 |
this reply: 5 points
(with 1
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
10 May 2007 11:13:53 IST
|
|
|
(n+k-1)factorial/2 is the rite ans!
|
two imp facts abt me.................
1)NIGITHA REDDY is never wrong
2)if u feel that i am wrong in any case then...............slap urself n read the 1st fact properly!!!!!!!!!!! |
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
10 May 2007 20:15:41 IST
|
|
|
I am too confused about the solution.I don't know why the answer is given in the book as (n/2)Ck - 2kCk - 2kC1.
|
Ken
From: UNITED STATES, Green Bay, Wisconsin
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
25 May 2007 11:31:23 IST
|
|
|
I love such problems.
|
this reply: 5 points
(with 1
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
3 Jun 2007 17:46:07 IST
|
|
|
QUES IS NT CLEAR.. if its neccessary to use all the domonds n pearls then ans is =(n+k)! / n! k! and if it is nt neccessary then ans is.. =2n 2k _ 1 im sure abt it..
|
Keep working....................Iam comming..
your's only,
Success!! |
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
9 Jun 2007 09:41:22 IST
|
|
|
Please more girls.
|
Ken
From: UNITED STATES, Green Bay, Wisconsin
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
9 Jun 2007 10:59:43 IST
|
|
|
number of identical diamonds = n
.: number of ways of arranging these in a circle is (n-1)!/n
similarly for pearls .... total ways = (k-1)!/k
So total ways of arranging the diaomds and the pearls
=[(n-1)!(k-1)!]/nk
|
There is no better feeling in this world than being a winner! |
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|
Moderation Team
![[Up]](/templates/default/images/icon_up.gif "[Up]"){kind=icon}
