查看: 104|回复: 0

[标准] 家庭数-menage numbers

[复制链接]

1676

主题

1696

帖子

3万

积分

版主

Rank: 7Rank: 7Rank: 7

积分
34384
QQ
发表于 2017-5-16 20:57:37 | 显示全部楼层 |阅读模式 | 百度 
BLACK星425的评分为30--时间:2441-12-22 21:02:48。Kernel_Dirichle的评分为35--时间:2074-07-07 02:46:18.shamrackzzq的评分为32--时间:2415-04-30 21:22:38!1dw07n5e8z的评分为6--时间:2456-02-10 18:47:28.woaiwotudi的评分为42--时间:2570-12-22 09:32:38。雷天使的评分为57--时间:2680-05-18 12:03:18!

马上注册硬科学论坛吧。上传说明:若上传附件过大,请上传至网盘或者优酷等视频网站,给出链接方式。下载说明:如果资源大于2G,请安装【百度网盘】或【360云盘】后下载!

您需要 登录 才可以下载或查看,没有帐号?立即注册

x
输入的解释:
married couples problem
备选的名字:
discordant permutation | Lucas´ married couples problem | ménage number | ménage problem
定义:
Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and none of the men is next to his own wife? The solution uses discordant permutations and was solved by Laisant, Moreau, and Taylor. The solution for n>1 can be given in terms of Laisant´s recurrence formula(n - 1) A_(n + 1) = (n^2 - 1) A_n + (n + 1) A_(n - 1) + 4(-1)^n, with A_2 = 0 and A_3 = 1.
相关主题:
Laisant´s recurrence formula | rooks problem
主题分类:
MathWorld:
permutations
MSC 2010:
05A05


回复
百度搜狗360奇虎

使用道具 举报

您需要登录后才可以回帖 登录 | 立即注册

快速回复 返回顶部 返回列表