kone.algebraicExtra/dev.lounres.kone.numberTheory

Package-level declarations

Types

Link copied to clipboard
@JvmInline
value class BezoutCoefficientsWithGCD<T>(val first: T, val second: T, val gcd: T)

Container for Bézout coefficients and GCD.

Functions

Link copied to clipboard
Link copied to clipboard
fun binomial(n: Int, k: Int): Int
fun binomial(n: Long, k: Long): Long
fun binomial(n: UInt, k: UInt): UInt
fun binomial(n: ULong, k: ULong): ULong

Computes binomial coefficient C(n, k).

Link copied to clipboard
fun <N> binomialPolynomial(n: N, k: Int): N
fun <N> binomialPolynomial(n: N, k: Long): N
fun <N> binomialPolynomial(n: N, k: UInt): N
fun <N> binomialPolynomial(n: N, k: ULong): N
Link copied to clipboard
fun <N> gcd(values: KoneIterable<N>): N
fun <N> gcd(vararg values: N): N
tailrec fun <N> gcd(a: N, b: N): N

fun gcd(values: KoneIterable<Int>): Int
fun gcd(values: KoneIterable<Long>): Long
fun gcd(vararg values: Int): Int
fun gcd(vararg values: Long): Long

Computes Greatest Common Divisor of the values.

tailrec fun gcd(a: Int, b: Int): Int
tailrec fun gcd(a: Long, b: Long): Long

Computes Greatest Common Divisor of a and b.

Link copied to clipboard
fun Int.isNotPrime(): Boolean
fun Long.isNotPrime(): Boolean

Test for not primality of this.

Link copied to clipboard
fun Int.isPrime(): Boolean
fun Long.isPrime(): Boolean

Trivial primality test by checking its divisibility by every integer between its square root and 2.

Link copied to clipboard
fun kroneckerSymbol(a: Int, b: Int): Int
fun kroneckerSymbol(a: Long, b: Long): Int

Computes Kronecker symbol of entries a and b.

Link copied to clipboard
Link copied to clipboard