Lines Matching defs:n
296 * echo "\r\n";
318 * @param BigInteger $n
321 public function modInverse(BigInteger $n)
323 return new static($this->value->modInverse($n->value));
331 * @param BigInteger $n
334 public function extendedGCD(BigInteger $n)
336 extract($this->value->extendedGCD($n->value));
354 * @param BigInteger $n
357 public function gcd(BigInteger $n)
359 return new static($this->value->gcd($n->value));
458 * @param BigInteger $n
461 public function powMod(BigInteger $e, BigInteger $n)
463 return new static($this->value->powMod($e->value, $n->value));
470 * @param BigInteger $n
473 public function modPow(BigInteger $e, BigInteger $n)
475 return new static($this->value->modPow($e->value, $n->value));
610 * Returns the smallest and largest n-bit number
734 * Returns the nth root of a positive biginteger, where n defaults to 2
736 * @param int $n optional
739 public function root($n = 2)
741 return new static($this->value->root($n));
747 * @param BigInteger $n
750 public function pow(BigInteger $n)
752 return new static($this->value->pow($n->value));
851 * ie. $s = gmp_scan1($n, 0) and $r = gmp_div_q($n, gmp_pow(gmp_init('2'), $s));