ADJUSTMENT BY LEAST SQUARES 167 
From which we can obtain, by dividing the second by mz, third by 
ms, °-° and adding 
I I d, 
tie (me — B=) D2 met me toe) GbE 
Nz Nz Nz 
For a first approximation m,’ we can put 
d, I 
mi =(d+22) / (n>), (6) 
Nz Nz 
and subsequent increments to this are given by 
m,!" = (2 el (ma’ -- my’ ae ee )) Vi (1 =) 2; ~), (7) 
Ne Me 
I I 
eee ae 
Nz Mz 
When all the polygons concerned have the same number 7 of 
sides, the formulae become 
Mm, S (nd, a 2d) /(n? ae N,’) ) (9) 
where m,’ is the number of polygons adjacent to, or at ‘‘first remove” 
from, the key polygon r. 
Also 
m,'’ = Dm,’ /(n? — n,’) 
m,/"’ = Im’ /(n? — n,/) te (10) 
Here 2 denotes the series of polygons excluding 7 which are at 
second remove from, i.e., are adjacent to these at first remove from r. 
We can again illustrate this system of approximation with refer- 
ence to the network of six triangles previously considered, Figure 2. 
Table II defines the constants concerned in each triangle, ” being 
equal to 3 throughout. 
TABLE If 
Ist-remove | 2nd-remove FU 
A d Ss As n Tr nd,+Zdz 
I +5 2,5 3,4) 6 7 3° 
2 +10 1,3 4,5 7 25 
3 — 10 2,4 1,5 di —4o 
4 — 20 3,5 I, 2,6 7 —65 
5 ateS I, 4,6 2,3 6 —I0 
6 —10 5 1,4 8 —25 

827 
