In this paper, we provide an algorithm to detect linear congruences of p l k (n) , the number of MacMahon's k -rowed plane partitions, and give a quantitative result on the nonexistence of Ramanujan-type congruences of the k -rowed plane partition functions. We also show p (n , m) that the number of partitions at most m parts always admits linear congruences.