A math question

来源: 万斤油 2012-05-03 07:24:23 [] [旧帖] [给我悄悄话] 本文已被阅读: 次 (255 bytes)
本文内容已被 [ 万斤油 ] 在 2012-06-08 15:15:07 编辑过。如有问题,请报告版主或论坛管理删除.

Six friends will exchange books in their book club. Each friend has one book to give
to a friend, and will receive one book from a different friend. (No two friends trade
books with each other.) In how many ways can the books be exchanged?

所有跟帖: 

Can wait jinjing, but not an easy one -Slowguy- 给 Slowguy 发送悄悄话 (41 bytes) () 05/03/2012 postreply 21:56:32

I think C(6,3)*2*2+6!/6=200.. -jinjing- 给 jinjing 发送悄悄话 (0 bytes) () 05/04/2012 postreply 06:17:44

回复:I think C(6,3)*2*2+6!/6=200.. -slowguy- 给 slowguy 发送悄悄话 (50 bytes) () 05/04/2012 postreply 06:25:34

Yes, I think C(6,3)*2*2+6!/6=200.. -jinjing- 给 jinjing 发送悄悄话 (320 bytes) () 05/04/2012 postreply 07:07:28

回复:Yes, I think C(6,3)*2*2+6!/6=200.. -Slowguy- 给 Slowguy 发送悄悄话 (871 bytes) () 05/04/2012 postreply 07:59:37

回复:回复:Yes, I think C(6,3)*2*2+6!/6=200.. -jinjing- 给 jinjing 发送悄悄话 (360 bytes) () 05/04/2012 postreply 08:56:10

Still not convinced -Slowguy- 给 Slowguy 发送悄悄话 (162 bytes) () 05/04/2012 postreply 09:06:41

You are right, should be C(6,3)/2*2*2 + 6!/6=160. two parts 10 c -jinjing- 给 jinjing 发送悄悄话 (96 bytes) () 05/04/2012 postreply 10:35:30

Thanks -Slowguy- 给 Slowguy 发送悄悄话 (0 bytes) () 05/04/2012 postreply 10:50:22

Yes, Slowguy is right -万斤油- 给 万斤油 发送悄悄话 (0 bytes) () 05/04/2012 postreply 11:15:16

If two people can exchange each other.the answer is 265 cases. -jinjing- 给 jinjing 发送悄悄话 (0 bytes) () 05/04/2012 postreply 10:57:58

If the total people is 7, what is the number of 3+4 part? Is any -wxcfan123- 给 wxcfan123 发送悄悄话 (0 bytes) () 05/05/2012 postreply 08:08:56

回复:If the total people is 7, what is the number of 3+4 part? Is -jinjing- 给 jinjing 发送悄悄话 (120 bytes) () 05/05/2012 postreply 10:04:16

thanks. So the general solution should be -wxcfan123- 给 wxcfan123 发送悄悄话 (416 bytes) () 05/06/2012 postreply 08:28:32

F(N) = SUM_(n1 + n2 + ... nk=N, ni >=3 ) {[C(N, n1)C(N-n1,n2).. -jinjing- 给 jinjing 发送悄悄话 (66 bytes) () 05/06/2012 postreply 09:37:01

... {[C(N, n1)C(N-n1,n2)..C(N-n1-n2-...n(k-1,nk)/D(n1,n2m,,,nk)] -jinjing- 给 jinjing 发送悄悄话 (0 bytes) () 05/06/2012 postreply 09:41:59

请您先登陆,再发跟帖!

发现Adblock插件

如要继续浏览
请支持本站 请务必在本站关闭Adblock

关闭Adblock后 请点击

请参考如何关闭Adblock

安装Adblock plus用户请点击浏览器图标
选择“Disable on www.wenxuecity.com”

安装Adblock用户请点击图标
选择“don't run on pages on this domain”