code: function bnpModInt(n) {
    var this_array = this.array;
    if(n <= 0) return 0;
    var d = BI_DV%n, r = (this.s<0)?n-1:0;
    if(this.t > 0)
      if(d == 0) r = this_array[0]%n;
      else for(var i = this.t-1; i >= 0; --i) r = (d*r+this_array[i])%n;
    return r;
  }
docs: (protected) this % n, n < 2^26