Irreducibility of a holomorphic eta quotient is determinable
  We show that a holomorphic eta quotient has only finitely many factors. We also provide an algorithm for checking irreducibility of holomorphic eta quotients by constructing an upper bound for the minimum of the levels of the proper factors of a reducible holomorphic eta quotient. 
Soumya Bhattacharya
math.NT