Complete settling of the multiplier conjecture for the case of n=3pr

In this paper we improve the character approach to the multiplier conjecture that we presented after 1992, and thus we have made considerable progress in the case of n = 3n₁. We prove that in the case of n = 3n₁ Second multiplier theorem remains true if the assumption “n₁ > λ” is replaced by “(n₁, λ) = 1”. Consequentially we prove that if we let D be a (v, k, λ)-difference set in an abelian group G, and n = 3p^r for some prime p, (p,v) = 1, then p is a numerical multiplier of D.