reviewer suggestion

Co-authored-by: Giacomo Pope <[email protected]>

Author: yyyyx4

src/sage/combinat/q_analogues.py

@@ -1046,17 +1046,14 @@ def number_of_irreducible_polynomials(n, q=None, m=1):
     from sage.functions.other import binomial
     from sage.combinat.partition import Partitions
 
-    def monic_reducible(irreducible, d):
+   def monic_reducible(irreducible, d):
         """
         Compute the number of monic reducible polynomials of degree `d`
         given the numbers of irreducible polynomials up to degree `d-1`.
         """
         res = 0
         for p in Partitions(d+1, max_part=d):
-            tmp = 1
-            for r, t in zip(irreducible, p.to_exp(d)):
-                tmp *= binomial(r+t-1, t)
-            res += tmp
+            res += prod( binomial(r+t-1,t) for r, t in zip(irreducible, p.to_exp(d)) )
         return res
 
     r = []