Rencontres Numbers
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
High Quality Content by WIKIPEDIA articles! In combinatorial mathematics, the rencontres numbers are a triangular array of integers that enumerate permutations of the set { 1, ..., n } with specified numbers of fixed points: in other words, partial derangements. (Rencontre is French for encounter. By some accounts, the problem is named after a solitaire game.) For n ? 0 and 0 ? k ? n, the rencontres number Dn, k is the number of permutations of { 1, ..., n } that have exactly k fixed points. For example, if seven presents are given to seven different people, but only two are destined to get the right present, there are D7, 2 = 924 ways this could happen. Данное издание не является оригинальным....
ISBN: 978-6-1312-4896-2
Издательство:
Книга по требованию
Дата выхода: июль 2011