tupelo.math.modular-arithmetic
add-mod-BigIntclj
(add-mod-BigInt a b N)Inputs: [a :- s/Int b :- s/Int N :- s/Int] Returns: BigInt
Adds two numbers a and b (mod N).
Inputs: [a :- s/Int b :- s/Int N :- s/Int] Returns: BigInt Adds two numbers a and b (mod N).
add-mod-BigIntegerclj
(add-mod-BigInteger a b N)Inputs: [a :- BigInteger b :- BigInteger N :- BigInteger] Returns: BigInteger
Adds two numbers a and b (mod N).
Inputs: [a :- BigInteger b :- BigInteger N :- BigInteger] Returns: BigInteger Adds two numbers a and b (mod N).
add-mod-Longclj
(add-mod-Long a b N)Inputs: [a :- Long b :- Long N :- Long] Returns: Long
Adds two numbers a and b (mod N).
Inputs: [a :- Long b :- Long N :- Long] Returns: Long Adds two numbers a and b (mod N).
mod-BigIntclj
(mod-BigInt n d)Inputs: [n :- s/Int d :- s/Int] Returns: BigInt
Computes the mod of two BigInt numbers, returning a BigInt.
Inputs: [n :- s/Int d :- s/Int] Returns: BigInt Computes the mod of two BigInt numbers, returning a BigInt.
mod-BigIntegerclj
(mod-BigInteger n d)Inputs: [n :- BigInteger d :- BigInteger] Returns: BigInteger
Computes the mod of two BigInteger numbers, returning a BigInteger.
Inputs: [n :- BigInteger d :- BigInteger] Returns: BigInteger Computes the mod of two BigInteger numbers, returning a BigInteger.
mod-inverseclj
(mod-inverse x N)Inputs: [x :- s/Int N :- s/Int] Returns: s/Int
Computes the 'inversey of a number x (mod N), such thatx*y (mod N)` = 1.
Uses the extended Euclid algorithm (iterative version). Assumes x and N are relatively prime.
Inputs: [x :- s/Int N :- s/Int] Returns: s/Int Computes the 'inverse` y of a number x (mod N), such that `x*y (mod N)` = 1. Uses the extended Euclid algorithm (iterative version). Assumes x and N are relatively prime.
mod-Longclj
(mod-Long n d)Inputs: [n :- Long d :- Long] Returns: Long
Computes the mod of two Long numbers, returning a Long.
Inputs: [n :- Long d :- Long] Returns: Long Computes the mod of two Long numbers, returning a Long.
mod-symmetricclj
(mod-symmetric i N)Inputs: [i :- s/Int N :- s/Int] Returns: s/Int
Like clojure.core/mod, but returns a result symmetric around zero [-N/2..N/2). N must be even and positive.
Inputs: [i :- s/Int N :- s/Int] Returns: s/Int Like clojure.core/mod, but returns a result symmetric around zero [-N/2..N/2). N must be even and positive.
mult-mod-BigIntclj
(mult-mod-BigInt a b N)Inputs: [a :- s/Int b :- s/Int N :- s/Int] Returns: BigInt
Multiply two numbers a and b (mod N).
Inputs: [a :- s/Int b :- s/Int N :- s/Int] Returns: BigInt Multiply two numbers a and b (mod N).
mult-mod-BigIntegerclj
(mult-mod-BigInteger a b N)Inputs: [a :- BigInteger b :- BigInteger N :- BigInteger] Returns: BigInteger
Multiply two numbers a and b (mod N).
Inputs: [a :- BigInteger b :- BigInteger N :- BigInteger] Returns: BigInteger Multiply two numbers a and b (mod N).
mult-mod-Longclj
(mult-mod-Long a b N)Inputs: [a :- Long b :- Long N :- Long] Returns: Long
Multiply two numbers a and b (mod N).
Inputs: [a :- Long b :- Long N :- Long] Returns: Long Multiply two numbers a and b (mod N).
quot-BigIntclj
(quot-BigInt n d)Inputs: [n :- s/Int d :- s/Int] Returns: BigInt
Computes the quot of two BigInt numbers, returning a BigInt.
Inputs: [n :- s/Int d :- s/Int] Returns: BigInt Computes the quot of two BigInt numbers, returning a BigInt.
quot-BigIntegerclj
(quot-BigInteger n d)Inputs: [n :- BigInteger d :- BigInteger] Returns: BigInteger
Computes the quot of two BigInteger numbers, returning a BigInteger.
Inputs: [n :- BigInteger d :- BigInteger] Returns: BigInteger Computes the quot of two BigInteger numbers, returning a BigInteger.
quot-Longclj
(quot-Long n d)Inputs: [n :- Long d :- Long] Returns: Long
Computes the quot of two Long numbers, returning a Long.
Inputs: [n :- Long d :- Long] Returns: Long Computes the quot of two Long numbers, returning a Long.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close