Function A

src/compute-engine/library/number-theory.ts:983–988

(n: bigint, k: bigint)

        const a0 = toBigint(aOp);
        const n = toBigint(nOp);
        if (a0 === null || n === null || n < 1n) return undefined;
        if (n === 1n) return ce.number(1);
        const a = ((a0 % n) + n) % n;
        if (gcd(a, n) !== 1n) return undefined;
        // The order divides λ(n); the smallest such divisor is the order.
        for (const d of divisorsAscending(
          carmichaelLambda(n, ce._deadlineFrame),
          ce._deadlineFrame
        )) {