Friedman Test for k=4: n=
| The logic and
computational details of the Friedman test are described in Subchapter 15a of Concepts and Applications. |
| count | A | B | C | D |
| 11 22 33 : nn | A1 A2 A3 : An | B1 B2 B3 : Bn | C1 C2 C3 : Cn | D1 D2 D3 : Dn |
| Ranks within
Rows | Raw Data for
Sample | ||||||||
| count | A | B | C | D | A | B | C | D | |
| Mean Ranks for
Sample | ||||||||||||||||||||
| A | B | C | D | |||||||||||||||||
|
|
|
|
| csqr =
|
|
| df
=
|
|
| P =
|
| | ||||||||
|
|
|
|