Hostname: page-component-745bb68f8f-hvd4g Total loading time: 0 Render date: 2025-02-06T09:02:06.712Z Has data issue: false hasContentIssue false
  • English
  • Français

1. On a Problem of Arrangements

Published online by Cambridge University Press:  15 September 2014

Cayley
Get access

Extract

It is a well-known problem to find for n letters the number of the arrangements in which no letter occupies its original place; and the solution of it is given by the following general theorem :— viz., the number of the arrangements which satisfy any r conditions is

where 1 denotes the whole number of arrangements; (1) the number of them which fail in regard to the first condition; (2) the number which fail in regard to the second condition; (12) the number which fail in regard to the first condition, and also in regard to the second condition; and so on: Σ(1) means (1) + (2) … + (r) : Σ(12) means (12) + (13) + (2r) … + (r − 1, r); and so on, up to (12…r), which denotes the number failing in regard to each of the r conditions.

Type
Proceedings 1876-77
Information
Proceedings of the Royal Society of Edinburgh , Volume 9 , 1878 , pp. 338 - 342
Copyright
Copyright © Royal Society of Edinburgh 1878

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)