The number of operations to evaluate Mod[a, b] is of order n if a has n digits and b is small. … (Examples of more difficult cases include HypergeometricPFQ[a, b, 1] and StieltjesGamma[k] , where logarithmic series can require an exponential number of terms. Evaluation of BernoulliB[x] is also difficult.)