Skip to content
Symi Docs
WASM / JavaScript

Signatures in the WASM / JavaScript view are TypeScript. Where the JavaScript facade wraps an operation its form is listed first; the other calling forms are the raw wasm-bindgen exports.

On this page

Integer number theory

All functions take and return Expression objects holding integer leaves, so arbitrary precision flows through the existing machinery; passing a non-integer expression raises. (Exception: continued_fraction_rational also accepts rational leaves; the three symbol functions return plain machine integers.)

is_prime#

Raw WebAssembly: Default context

isPrime(n: Expression): boolean | undefined
Calling forms

Raw WebAssembly: Explicit context: Context.isPrime

isPrime(n: Expression): boolean | undefined

Expression method: Expression.isPrime

isPrime(): boolean | null

Raw WebAssembly: Expression method: Expression.isPrime

isPrime(): boolean | undefined

Deterministic primality verdict; None when the input is outside the classifier's domain (e.g. not a natural number ≥0\geq 0 representation it handles).

factor_integer#

Not exposed by the WASM / JavaScript bindings. Available as Context.factor_integer in Python, UniffiSession.factorInteger in Kotlin, UniffiSession.factorInteger in Swift, api::Session::factor_integer in Rust.

Prime factorization as (prime, multiplicity) pairs, ascending. Errors on zero. Notes: WASM returns PrimeFactor objects with prime/multiplicity getters; the sign −1-1 of a negative input is carried as a leading (-1, 1) factor exactly as the core reports it.

prime_factor (WASM result class)#

prime#

Raw WebAssembly: PrimeFactor property

readonly prime: Expression

The prime.

multiplicity#

Raw WebAssembly: PrimeFactor property

readonly multiplicity: number
Calling forms and variants

Variant for this object — Raw WebAssembly: RootMultiplicity property: RootMultiplicity.multiplicity

readonly multiplicity: number

integer_gcd#

Not exposed by the WASM / JavaScript bindings. Available as Context.integer_gcd in Python, UniffiSession.integerGcd in Kotlin, UniffiSession.integerGcd in Swift, api::Session::integer_gcd in Rust.

Greatest common divisor (non-negative).

integer_lcm#

Not exposed by the WASM / JavaScript bindings. Available as Context.integer_lcm in Python, UniffiSession.integerLcm in Kotlin, UniffiSession.integerLcm in Swift, api::Session::integer_lcm in Rust.

Least common multiple.

extended_euclidean#

Not exposed by the WASM / JavaScript bindings. Available as Context.extended_euclidean in Python, UniffiSession.extendedEuclidean in Kotlin, UniffiSession.extendedEuclidean in Swift, api::number_theory::Session::extended_euclidean in Rust.

(gcd, x, y) with ax+by=gcd⁡a x + b y = \operatorname{gcd}. Notes: WASM returns a 3-element array [gcd, x, y].

modular_power#

Not exposed by the WASM / JavaScript bindings. Available as Context.modular_power in Python, UniffiSession.modularPower in Kotlin, UniffiSession.modularPower in Swift, api::number_theory::Session::modular_power in Rust.

base^exponent mod modulus by square-and-multiply; requires positive modulus and non-negative exponent.

modular_inverse#

Not exposed by the WASM / JavaScript bindings. Available as Context.modular_inverse in Python, UniffiSession.modularInverse in Kotlin, UniffiSession.modularInverse in Swift, api::number_theory::Session::modular_inverse in Rust.

Multiplicative inverse of value modulo modulus; errors when gcd⁡(value⁡,modulus⁡)≠1\operatorname{gcd}(\operatorname{value}, \operatorname{modulus}) \ne 1.

chinese_remainder#

Not exposed by the WASM / JavaScript bindings. Available as Context.chinese_remainder in Python, UniffiSession.chineseRemainder in Kotlin, UniffiSession.chineseRemainder in Swift, api::number_theory::Session::chinese_remainder in Rust.

The smallest non-negative solution of the simultaneous congruences x≡ri(modmi)x \equiv r_i \pmod{m_i}. Moduli need not be pairwise coprime; inconsistent systems raise. Notes: WASM passes a flat interleaved array [residue_0, modulus_0, ...].

euler_totient#

Not exposed by the WASM / JavaScript bindings. Available as Context.euler_totient in Python, UniffiSession.eulerTotient in Kotlin, UniffiSession.eulerTotient in Swift, api::number_theory::Session::euler_totient in Rust.

Euler's φ(n)\varphi(n); requires a positive integer.

mobius#

Raw WebAssembly: Default context

mobius(n: Expression): Expression
Calling forms

Raw WebAssembly: Explicit context: Context.mobius

mobius(n: Expression): Expression

Möbius μ(n)∈{−1,0,1}\mu(n) \in \{-1, 0, 1\}; requires a positive integer.

divisor_count#

Not exposed by the WASM / JavaScript bindings. Available as Context.divisor_count in Python, UniffiSession.divisorCount in Kotlin, UniffiSession.divisorCount in Swift, api::Session::divisor_count in Rust.

Number of positive divisors τ(n)\tau(n).

divisor_sigma#

Not exposed by the WASM / JavaScript bindings. Available as Context.divisor_sigma in Python, UniffiSession.divisorSigma in Kotlin, UniffiSession.divisorSigma in Swift, api::Session::divisor_sigma in Rust.

Sum of the power-th powers of the positive divisors σpower(n)\sigma_{\mathit{power}}(n); power = 0 gives divisor_count, power = 1 the divisor sum.

jacobi_symbol#

Not exposed by the WASM / JavaScript bindings. Available as Context.jacobi_symbol in Python, UniffiSession.jacobiSymbol in Kotlin, UniffiSession.jacobiSymbol in Swift, api::Session::jacobi_symbol in Rust.

The Jacobi symbol (n/d)∈{−1,0,1}(n/d) \in \{-1, 0, 1\}; the denominator must be a positive odd integer.

legendre_symbol#

Not exposed by the WASM / JavaScript bindings. Available as Context.legendre_symbol in Python, UniffiSession.legendreSymbol in Kotlin, UniffiSession.legendreSymbol in Swift, api::Session::legendre_symbol in Rust.

The Legendre symbol; the second argument must be an odd prime.

kronecker_symbol#

Not exposed by the WASM / JavaScript bindings. Available as Context.kronecker_symbol in Python, UniffiSession.kroneckerSymbol in Kotlin, UniffiSession.kroneckerSymbol in Swift, api::Session::kronecker_symbol in Rust.

The Kronecker extension of the Jacobi symbol to all integer denominators.

integer_square_root#

Not exposed by the WASM / JavaScript bindings. Available as Context.integer_square_root in Python, UniffiSession.integerSquareRoot in Kotlin, UniffiSession.integerSquareRoot in Swift, api::Session::integer_square_root in Rust.

⌊n⌋\lfloor\sqrt{n}\rfloor for non-negative n.

integer_nth_root#

Not exposed by the WASM / JavaScript bindings. Available as Context.integer_nth_root in Python, UniffiSession.integerNthRoot in Kotlin, UniffiSession.integerNthRoot in Swift, api::Session::integer_nth_root in Rust.

⌊n1/root_index⌋\lfloor n^{1/\mathit{root\_index}}\rfloor; odd indices accept negative n. Errors when no real root exists (even index, negative n).

continued_fraction_rational#

Not exposed by the WASM / JavaScript bindings. Available as Context.continued_fraction_rational in Python, UniffiSession.continuedFractionRational in Kotlin, UniffiSession.continuedFractionRational in Swift, api::number_theory::Session::continued_fraction_rational in Rust.

Terminating continued-fraction expansion [a0; a1, a2, ...] of an integer or rational expression leaf.

continued_fraction_quadratic_irrational#

Not exposed by the WASM / JavaScript bindings. Available as Context.continued_fraction_quadratic_irrational in Python, UniffiSession.continuedFractionQuadraticIrrational in Kotlin, UniffiSession.continuedFractionQuadraticIrrational in Swift, api::number_theory::Session::continued_fraction_quadratic_irrational in Rust.

Eventually-periodic expansion of d\sqrt{d} for a non-negative integer d, returned as (initial_terms, periodic_part). Perfect squares give a one-element initial part and an empty period. Notes: WASM returns a QuadraticContinuedFractionExpansion object with initial_terms/periodic_terms getters.

quadratic_continued_fraction_expansion (WASM result class)#

initial_terms#

Not exposed by the WASM / JavaScript bindings. Available as UniffiQuadraticContinuedFractionExpansion.initialTerms in Kotlin, UniffiQuadraticContinuedFractionExpansion.initialTerms in Swift, api::results::QuadraticContinuedFractionExpansion::initial_terms in Rust.

periodic_terms#

Not exposed by the WASM / JavaScript bindings. Available as UniffiQuadraticContinuedFractionExpansion.periodicTerms in Kotlin, UniffiQuadraticContinuedFractionExpansion.periodicTerms in Swift, api::results::QuadraticContinuedFractionExpansion::periodic_terms in Rust.

Diophantine equations#

The two supported Diophantine subclasses are linear equations via the extended Euclidean algorithm and Pell's equation via the continued fraction of D\sqrt{D}. General Diophantine solving is undecidable (Matiyasevich–Robinson–Davis–Putnam) and is out of scope; the solvers return exact integers and never guess.

solve_linear_diophantine#

Not exposed by the WASM / JavaScript bindings. Available as Context.solve_linear_diophantine in Python, UniffiSession.solveLinearDiophantine in Kotlin, UniffiSession.solveLinearDiophantine in Swift, api::number_theory::Session::solve_linear_diophantine in Rust.

General integer solution of a1x1+…+anxn=ca_1 x_1 + \ldots + a_n x_n = c, returned as the parametric coordinates — one expression per unknown, affine in fresh integer parameter symbols (diophantine_parameter_k) shared across the coordinates so that choosing any integers for the parameters yields a solution tuple. The list is empty only when the equation provably has no integer solution (gcd⁡(ai)∤c\gcd(a_i) \nmid c). When every coefficient and the constant are zero, each coordinate is its own fresh integer parameter. All coefficients and the constant must be integer expression leaves; any other input, including an empty coefficient list, raises a declined-computation error instead of returning an empty list.

solve_linear_diophantine_system#

Not exposed by the WASM / JavaScript bindings. Available as Context.solve_linear_diophantine_system in Python, UniffiSession.solveLinearDiophantineSystem in Kotlin, UniffiSession.solveLinearDiophantineSystem in Swift, api::number_theory::Session::solve_linear_diophantine_system in Rust.

General integer solution of the rectangular system Ax=bA x = b, returned as one parametric coordinate expression per column of A. The coordinates share fresh integer parameter symbols and describe the complete affine integer lattice of solutions. The list is empty only when the system provably has no integer solution. A row count of A that differs from the number of constants raises a length-mismatch error, and an entry that is not an integer expression leaf raises a declined-computation error.

solve_pell#

Not exposed by the WASM / JavaScript bindings. Available as Context.solve_pell in Python, UniffiSession.solvePell in Kotlin, UniffiSession.solvePell in Swift, api::number_theory::Session::solve_pell in Rust.

Fundamental solution [x, y] of x2−Dy2=1x^2 - D y^2 = 1 for a positive non-square integer D, the smallest positive solution from which all others are generated by the recurrence xk+1=x1xk+Dy1ykx_{k+1} = x_1 x_k + D y_1 y_k, yk+1=x1yk+y1xky_{k+1} = x_1 y_k + y_1 x_k. The list is empty when D is a perfect square or non-positive (no nontrivial fundamental solution). A radicand that is not an exact integer raises an integer-required error.

solve_negative_pell#

Not exposed by the WASM / JavaScript bindings. Available as Context.solve_negative_pell in Python, UniffiSession.solveNegativePell in Kotlin, UniffiSession.solveNegativePell in Swift, api::number_theory::Session::solve_negative_pell in Rust.

Fundamental solution [x, y] of the negative-Pell equation x2−Dy2=−1x^2 - D y^2 = -1 when it is solvable (exactly when the continued fraction of D\sqrt{D} has odd period), and an empty list for an integer D for which it is not. A radicand that is not an exact integer raises an integer-required error.

pell_solutions#

Not exposed by the WASM / JavaScript bindings. Available as Context.pell_solutions in Python, UniffiSession.pellSolutions in Kotlin, UniffiSession.pellSolutions in Swift, api::number_theory::Session::pell_solutions in Rust.

The first count positive solutions of x2−Dy2=1x^2 - D y^2 = 1, materialised from the fundamental solution by the Pell recurrence and returned as a flat list [x1,y1,x2,y2,…][x_1, y_1, x_2, y_2, \ldots]. Empty when the integer D has no fundamental solution; a radicand that is not an exact integer raises an integer-required error.

Integer-domain solving#

solve_integers is the deliberate integer-domain solver. It takes a conjunction of equations and linear congruences in an ordered list of integer unknowns, and either states the complete integer solution set or declines with a typed reason. It never returns a few sampled solutions as if they were all of them, and it never reports "no solution" for a problem it could not decide. General Diophantine equations are undecidable, so the accepted classes are deliberately narrow:

Request Result
One unknown, rational-coefficient polynomial or rational equations finite, empty, or lattice_family (every integer except undefined_points)
One unknown, linear congruences, with or without equations congruence_family (one residue class), finite, or empty
Several unknowns, affine equations and congruences lattice_family, finite, or empty, by Smith normal form
Two unknowns, one equation a*x^2 + b*y^2 + c = 0 reducing to x^2 - D*y^2 = N pell_orbits, finite, or empty
Anything else, including symbolic parameters declined with unsupported_class

solve_integers#

Raw WebAssembly: Default context

solveIntegers(
    equations: Expression[],
    unknowns: string[],
    congruences: Expression[],
    moduli: Expression[],
    maximum_seed_candidates: number,
    maximum_integer_bits: number,
): IntegerSolveReport
Calling forms

Raw WebAssembly: Explicit context: Context.solveIntegers

solveIntegers(
    equations: Expression[],
    unknowns: string[],
    congruences: Expression[],
    moduli: Expression[],
    maximum_seed_candidates: number,
    maximum_integer_bits: number,
): IntegerSolveReport

Each equation is an equation or an expression meaning expression = 0. Congruence i states that congruences[i] vanishes modulo the positive integer moduli[i]; congruences are passed through this typed boundary, never parsed from mod syntax, and must be affine with integer coefficients. An empty or repeated unknown list, a moduli list of a different length, a modulus that is not a positive integer, and a zero limit are errors, not declines.

Every report that is not declined reads the same way. The integer solutions are exactly the tuples obtained by substituting integers for parameters into one of the solutions, other than the undefined_points. The three kinds of answer are kept apart:

  • finite and empty have no parameters: solutions is the whole enumerated set, and an empty list is a proof of no solution.
  • lattice_family and congruence_family are unbounded integer parameter families: 6*x + 9*y = 21 gives one tuple affine in one parameter, with its lattice_particular point and Hermite-reduced lattice_basis; 6x≡9(mod15)6x \equiv 9 \pmod{15} gives x = 4 + 5*k with residue 4 and modulus 5.
  • pell_orbits is a union of orbits under multiplication by the norm-one unit, not a list of samples. x^2 - 5*y^2 = 4 reports its pell_equation, the unit (9, 4), one seed per orbit, and two closed-form tuples per seed, one for each sign, exact in an integer exponent k. Every orbit is covered because each solution has exactly one representative in the unit's fundamental interval, and the scan of that interval is exhaustive.

Source definedness is kept: 1/(x - 1) = 0 is empty, and undefined_points still lists 1. A request whose proof would exceed a limit declines rather than returning part of the answer: a generalized Pell scan needing more than maximum_seed_candidates ordinates declines with seed_candidate_limit, and an integer or unit longer than maximum_integer_bits bits declines with integer_size_limit or fundamental_unit_limit. x^3 + y^3 + z^3 = 3 declines with unsupported_class. Python returns a dictionary with one key per report field below; WASM, Kotlin, and Swift return an IntegerSolveReport object.

IntegerSolveReport#

Not exposed by the WASM / JavaScript bindings. Available as api::IntegerSolveReport in Rust.

What solve_integers returns. complete is false only for a declined report.

integer_report_verdict#

Raw WebAssembly: IntegerSolveReport property

readonly verdict: string

Getter on IntegerSolveReport: finite, empty, lattice_family, congruence_family, pell_orbits, or declined.

integer_report_complete#

Raw WebAssembly: IntegerSolveReport property

readonly complete: boolean

Getter on IntegerSolveReport: whether the report states the whole integer solution set.

integer_report_unknowns#

Raw WebAssembly: IntegerSolveReport property

readonly unknowns: Expression[]

Getter on IntegerSolveReport: the requested unknowns, in the order every tuple uses.

integer_report_solutions#

Raw WebAssembly: IntegerSolveReport property

readonly solutions: IntegerSolutionTuple[]

Getter on IntegerSolveReport: the solution tuples, exact in the integer parameters.

integer_report_parameters#

Raw WebAssembly: IntegerSolveReport property

readonly parameters: Expression[]

Getter on IntegerSolveReport: the parameters of the solution tuples, each ranging over every integer.

integer_report_undefined_points#

Raw WebAssembly: IntegerSolveReport property

readonly undefinedPoints: IntegerSolutionTuple[]

Getter on IntegerSolveReport: the integer points at which some source equation is undefined. No solution is one of them.

integer_report_lattice_particular#

Raw WebAssembly: IntegerSolveReport property

readonly latticeParticular: IntegerSolutionTuple | undefined

Getter on IntegerSolveReport: one point of the solution lattice of a lattice_family report.

integer_report_lattice_basis#

Raw WebAssembly: IntegerSolveReport property

readonly latticeBasis: IntegerSolutionTuple[]

Getter on IntegerSolveReport: a Hermite-reduced basis of the direction lattice of a lattice_family report.

integer_report_residue#

Raw WebAssembly: IntegerSolveReport property

readonly residue: Expression | undefined

Getter on IntegerSolveReport: the least nonnegative member of the class of a congruence_family report.

integer_report_modulus#

Raw WebAssembly: IntegerSolveReport property

readonly modulus: Expression | undefined

Getter on IntegerSolveReport: the positive modulus of the class of a congruence_family report.

integer_report_pell_equation#

Raw WebAssembly: IntegerSolveReport property

readonly pellEquation: Expression | undefined

Getter on IntegerSolveReport: the normalized equation x^2 - D*y^2 = N of a pell_orbits report, written in the unknowns.

integer_report_pell_unit#

Raw WebAssembly: IntegerSolveReport property

readonly pellUnit: IntegerSolutionTuple | undefined

Getter on IntegerSolveReport: the fundamental solution (u, v) of u^2 - D*v^2 = 1 that generates every orbit.

integer_report_pell_seeds#

Raw WebAssembly: IntegerSolveReport property

readonly pellSeeds: IntegerSolutionTuple[]

Getter on IntegerSolveReport: one seed per orbit, in the order of the requested unknowns.

integer_report_proof_methods#

Raw WebAssembly: IntegerSolveReport property

readonly proofMethods: string[]

Getter on IntegerSolveReport: the kinds of exact evidence the result rests on, such as integer_root_theorem, chinese_remainder, smith_normal_form, or pell_fundamental_interval.

integer_report_decline_reason#

Raw WebAssembly: IntegerSolveReport property

readonly declineReason: string | undefined

Getter on IntegerSolveReport: why the solve made no claim, present exactly when the verdict is declined.

IntegerSolutionTuple#

Not exposed by the WASM / JavaScript bindings. Available as api::IntegerSolutionTuple in Rust.

One exact tuple of a report, with one coordinate per requested unknown.

integer_tuple_coordinates#

Raw WebAssembly: IntegerSolutionTuple property

readonly coordinates: Expression[]

Getter on IntegerSolutionTuple: the coordinates, in the order of the requested unknowns.

Example#

This family is not part of the recommended JavaScript facade in this release. Call it through the generated symi.raw layer, whose entries are listed with their wasm-bindgen signatures above, and read Migration for the ownership rules that apply there.

Additional API#

chineseRemainder#

Raw WebAssembly: Default context

chineseRemainder(residues_and_moduli: Expression[]): Expression

The smallest non-negative solution of the simultaneous congruences x≡ri(modmi)x \equiv r_i \pmod{m_i}.

Calling forms

Raw WebAssembly: Explicit context: Context.chineseRemainder

chineseRemainder(residues_and_moduli: Expression[]): Expression

continuedFractionQuadraticIrrational#

Raw WebAssembly: Default context

continuedFractionQuadraticIrrational(value: Expression): QuadraticContinuedFractionExpansion

Eventually-periodic expansion of d\sqrt{d} for a non-negative integer d, returned as (initial_terms, periodic_part).

Calling forms

Raw WebAssembly: Explicit context: Context.continuedFractionQuadraticIrrational

continuedFractionQuadraticIrrational(value: Expression): QuadraticContinuedFractionExpansion

continuedFractionRational#

Raw WebAssembly: Default context

continuedFractionRational(value: Expression): Expression[]

Terminating continued-fraction expansion [a0; a1, a2, ...] of an integer or rational expression leaf.

Calling forms

Raw WebAssembly: Explicit context: Context.continuedFractionRational

continuedFractionRational(value: Expression): Expression[]

divisorCount#

Raw WebAssembly: Default context

divisorCount(n: Expression): Expression

Number of positive divisors τ(n)\tau(n).

Calling forms

Raw WebAssembly: Explicit context: Context.divisorCount

divisorCount(n: Expression): Expression

divisorSigma#

Raw WebAssembly: Default context

divisorSigma(n: Expression, power: number): Expression

Sum of the power-th powers of the positive divisors σpower(n)\sigma_{\mathit{power}}(n); power = 0 gives divisor_count, power = 1 the divisor sum.

Calling forms

Raw WebAssembly: Explicit context: Context.divisorSigma

divisorSigma(n: Expression, power: number): Expression

eulerTotient#

Raw WebAssembly: Default context

eulerTotient(n: Expression): Expression

Euler's φ(n)\varphi(n); requires a positive integer.

Calling forms

Raw WebAssembly: Explicit context: Context.eulerTotient

eulerTotient(n: Expression): Expression

extendedEuclidean#

Raw WebAssembly: Default context

extendedEuclidean(a: Expression, b: Expression): Expression[]

(gcd, x, y) with ax+by=gcd⁡a x + b y = \operatorname{gcd}.

Calling forms

Raw WebAssembly: Explicit context: Context.extendedEuclidean

extendedEuclidean(a: Expression, b: Expression): Expression[]

factorInteger#

Raw WebAssembly: Default context

factorInteger(n: Expression): PrimeFactor[]

Prime factorization as (prime, multiplicity) pairs, ascending. Errors on zero. Notes: WASM returns prime_factor objects with prime/multiplicity getters; the sign −1-1 of a negative input is carried as a leading (-1, 1) factor exactly as the core reports it.

Calling forms

Raw WebAssembly: Explicit context: Context.factorInteger

factorInteger(n: Expression): PrimeFactor[]

integerGcd#

Raw WebAssembly: Default context

integerGcd(a: Expression, b: Expression): Expression

Greatest common divisor (non-negative).

Calling forms

Raw WebAssembly: Explicit context: Context.integerGcd

integerGcd(a: Expression, b: Expression): Expression

integerLcm#

Raw WebAssembly: Default context

integerLcm(a: Expression, b: Expression): Expression

Least common multiple.

Calling forms

Raw WebAssembly: Explicit context: Context.integerLcm

integerLcm(a: Expression, b: Expression): Expression

integerNthRoot#

Raw WebAssembly: Default context

integerNthRoot(n: Expression, root_index: bigint): Expression

⌊n1/root_index⌋\lfloor n^{1/\mathit{root\_index}}\rfloor; odd indices accept negative n. Errors when no real root exists (even index, negative n).

Calling forms

Raw WebAssembly: Explicit context: Context.integerNthRoot

integerNthRoot(n: Expression, root_index: bigint): Expression

integerSquareRoot#

Raw WebAssembly: Default context

integerSquareRoot(n: Expression): Expression

⌊n⌋\lfloor\sqrt{n}\rfloor for non-negative n.

Calling forms

Raw WebAssembly: Explicit context: Context.integerSquareRoot

integerSquareRoot(n: Expression): Expression

jacobiSymbol#

Raw WebAssembly: Default context

jacobiSymbol(numerator: Expression, denominator: Expression): number

The Jacobi symbol (n/d)∈{−1,0,1}(n/d) \in \{-1, 0, 1\}; the denominator must be a positive odd integer.

Calling forms

Raw WebAssembly: Explicit context: Context.jacobiSymbol

jacobiSymbol(numerator: Expression, denominator: Expression): number

kroneckerSymbol#

Raw WebAssembly: Default context

kroneckerSymbol(numerator: Expression, denominator: Expression): number

The Kronecker extension of the Jacobi symbol to all integer denominators.

Calling forms

Raw WebAssembly: Explicit context: Context.kroneckerSymbol

kroneckerSymbol(numerator: Expression, denominator: Expression): number

legendreSymbol#

Raw WebAssembly: Default context

legendreSymbol(numerator: Expression, prime: Expression): number

The Legendre symbol; the second argument must be an odd prime.

Calling forms

Raw WebAssembly: Explicit context: Context.legendreSymbol

legendreSymbol(numerator: Expression, prime: Expression): number

modularInverse#

Raw WebAssembly: Default context

modularInverse(value: Expression, modulus: Expression): Expression

Multiplicative inverse of value modulo modulus; errors when gcd⁡(value⁡,modulus⁡)≠1\operatorname{gcd}(\operatorname{value}, \operatorname{modulus}) \ne 1.

Calling forms

Raw WebAssembly: Explicit context: Context.modularInverse

modularInverse(value: Expression, modulus: Expression): Expression

modularPower#

Raw WebAssembly: Default context

modularPower(
    base: Expression,
    exponent: Expression,
    modulus: Expression,
): Expression

base^exponent mod modulus by square-and-multiply; requires positive modulus and non-negative exponent.

Calling forms

Raw WebAssembly: Explicit context: Context.modularPower

modularPower(
    base: Expression,
    exponent: Expression,
    modulus: Expression,
): Expression

pellSolutions#

Raw WebAssembly: Default context

pellSolutions(radicand: Expression, count: number): Expression[]

The first count positive solutions of x2−Dy2=1x^2 - D y^2 = 1, materialised from the fundamental solution by the Pell recurrence and returned as a flat list [x1,y1,x2,y2,…][x_1, y_1, x_2, y_2, \ldots].

Calling forms

Raw WebAssembly: Explicit context: Context.pellSolutions

pellSolutions(radicand: Expression, count: number): Expression[]

solveLinearDiophantine#

Raw WebAssembly: Default context

solveLinearDiophantine(
    coefficients: Expression[],
    constant: Expression,
): Expression[]

General integer solution of a1x1+…+anxn=ca_1 x_1 + \ldots + a_n x_n = c, returned as the parametric coordinates — one expression per unknown, affine in fresh integer parameter symbols (diophantine_parameter_k) shared across the coordinates so that choosing any integers for the parameters yields a solution tuple. The list is empty when the equation has no integer solution (gcd⁡(ai)∤c\gcd(a_i) \nmid c).

Calling forms

Raw WebAssembly: Explicit context: Context.solveLinearDiophantine

solveLinearDiophantine(
    coefficients: Expression[],
    constant: Expression,
): Expression[]

solveLinearDiophantineSystem#

Raw WebAssembly: Default context

solveLinearDiophantineSystem(
    coefficient_matrix: Matrix,
    constants: Expression[],
): Expression[]

General integer solution of the rectangular system Ax=bA x = b, returned as one parametric coordinate expression per column of A.

Calling forms

Raw WebAssembly: Explicit context: Context.solveLinearDiophantineSystem

solveLinearDiophantineSystem(
    coefficient_matrix: Matrix,
    constants: Expression[],
): Expression[]

solveNegativePell#

Raw WebAssembly: Default context

solveNegativePell(radicand: Expression): Expression[]

Fundamental solution [x, y] of the negative-Pell equation x2−Dy2=−1x^2 - D y^2 = -1 when it is solvable (exactly when the continued fraction of D\sqrt{D} has odd period), and an empty list otherwise.

Calling forms

Raw WebAssembly: Explicit context: Context.solveNegativePell

solveNegativePell(radicand: Expression): Expression[]

solvePell#

Raw WebAssembly: Default context

solvePell(radicand: Expression): Expression[]

Fundamental solution [x, y] of x2−Dy2=1x^2 - D y^2 = 1 for a positive non-square integer D, the smallest positive solution from which all others are generated by the recurrence xk+1=x1xk+Dy1ykx_{k+1} = x_1 x_k + D y_1 y_k, yk+1=x1yk+y1xky_{k+1} = x_1 y_k + y_1 x_k.

Calling forms

Raw WebAssembly: Explicit context: Context.solvePell

solvePell(radicand: Expression): Expression[]

QuadraticContinuedFractionExpansion#

QuadraticContinuedFractionExpansion.initialTerms#

Raw WebAssembly: QuadraticContinuedFractionExpansion property

readonly initialTerms: Expression[]

The terms preceding the periodic part of the expansion.

QuadraticContinuedFractionExpansion.periodicTerms#

Raw WebAssembly: QuadraticContinuedFractionExpansion property

readonly periodicTerms: Expression[]

The repeating terms of the expansion.

RootMultiplicity#

RootMultiplicity.root#

Raw WebAssembly: RootMultiplicity property

readonly root: Expression

Principal n-th root, stored as x^(1/n).

Symi documentation · WASM / JavaScript