OF THE COMPOSITIONS OF NUMBERS. 
883 
63. Hence the number of lines of route through the reticulation which yjossess 
exactly s essential nodes is equal to the number of permutations of the letters in 
. . . a/", 
for which 
’’2 + ’b + • • • + ’ 
Vi denoting the number of times that the letter occurs in the first 
2^1 + • • • + Pt-\ 
places of permutation. 
64. We are at once led to an important identity of enumeration in the pure theory 
of permutations. Following the nomenclature of a previous section of the investiga¬ 
tion, a line of route through the reticulation is traced out by a succession of steps, 
each step being an step or an &c., or an step. 
The whole length of the line of route there are altogether steps, p.^, a., steps, 
&c., . . . steps. 
Without regard to the characteristic of lines of route in respect of essential nodes, 
the whole number of lines of route is equal to the number of different orders in which 
these steps can be taken, viz., equal to the whole number of permutations of the 
letters in 
ap^ap- . . . aL,p‘. 
An essential node occurs whenever a step a„ immediately precedes a step a^, where 
u > t. 
In the corresponding permutation there is a contact 
u > t, 
which may be called a major contact. 
Hence a line of route with s essential nodes is represented by a permutation with 
s major contacts. We have thus the theorem :— 
“ In the reticulation of the multipartite number . . . Pn the number of lines of 
route which possess exactly essential nodes is equal to the number of permutations 
of the letters in the product 
y 
which possess exactly s major contacts.” 
“ Calling a contact a major contact when u > t the number of permutations of 
the letters in the product 
. . . a/", 
5 u 2 
