The problem of arranging v elements into v sets in such a way that every set contains exactly k distinct elements and that every pair of sets has exactly λ = k(k — l)/(v — 1) elements in common, where 0 < » < k < v, is equivalent to finding a normal integral v by v matrix A such that AT A = B, where B is the v by v matrix having k in every position on the main diagonal and λ in all other positions (10). Utilizing the fact that for the existence of a λ, k, v design it is necessary that I (the v by v identity matrix) represent B rationally, (2) and (3) have proved the non-existence of certain λ, k, v designs. Neither of the proofs utilize the fact that it is necessary that A be normal. However, Albert (1) for the projective plane case and Hall and Ryser (5) for the general design proved that if there exists a rational A such that ATA = B then there exists a normal rational matrix satisfying the same equation. Thus the requirement of normality does not exclude any λ, k, v which were not previously excluded.