- Sort Score
- Num 10 results
- Language All
Results 1 - 4 of 4 for totient (0.14 seconds)
-
lib/fips140/v1.26.0.zip
"SHA-256", hash) if err != nil { return err } return verifyPKCS1v15(k.PublicKey(), "SHA-256", hash, sig) }) } return k, nil } } // errDivisorTooLarge is returned by [totient] when gcd(p-1, q-1) is too large. var errDivisorTooLarge = errors.New("divisor too large") // totient computes the Carmichael totient function λ(N) = lcm(p-1, q-1). func totient(p, q *bigmod.Modulus) (*bigmod.Modulus, error) { a, b := p.Nat().SubOne(p), q.Nat().SubOne(q) // lcm(a, b) = a×b / gcd(a, b) = a × (b / gcd(a, b)) // Our GCD...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
"SHA-256", hash) if err != nil { return err } return verifyPKCS1v15(k.PublicKey(), "SHA-256", hash, sig) }) } return k, nil } } // errDivisorTooLarge is returned by [totient] when gcd(p-1, q-1) is too large. var errDivisorTooLarge = errors.New("divisor too large") // totient computes the Carmichael totient function λ(N) = lcm(p-1, q-1). func totient(p, q *bigmod.Modulus) (*bigmod.Modulus, error) { a, b := p.Nat().SubOne(p), q.Nat().SubOne(q) // lcm(a, b) = a×b / gcd(a, b) = a × (b / gcd(a, b)) // Our GCD...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
src/main/webapp/css/admin/bootstrap.min.css.map
$divisor == 0 {\n @error \"Cannot divide by 0\";\n }\n $remainder: $dividend;\n $result: 0;\n $factor: 10;\n @while ($remainder > 0 and $precision >= 0) {\n $quotient: 0;\n @while ($remainder >= $divisor) {\n $remainder: $remainder - $divisor;\n $quotient: $quotient + 1;\n }\n $result: $result * 10 + $quotient;\n $factor: $factor * .1;\n $remainder: $remainder * 10;\n $precision: $precision - 1;\n @if ($precision < 0 and $remainder >= $divisor * 5) {\n $result:...Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Oct 26 01:49:09 GMT 2024 - 639.3K bytes - Click Count (1) -
src/main/webapp/css/bootstrap.min.css.map
$divisor == 0 {\n @error \"Cannot divide by 0\";\n }\n $remainder: $dividend;\n $result: 0;\n $factor: 10;\n @while ($remainder > 0 and $precision >= 0) {\n $quotient: 0;\n @while ($remainder >= $divisor) {\n $remainder: $remainder - $divisor;\n $quotient: $quotient + 1;\n }\n $result: $result * 10 + $quotient;\n $factor: $factor * .1;\n $remainder: $remainder * 10;\n $precision: $precision - 1;\n @if ($precision < 0 and $remainder >= $divisor * 5) {\n $result:...Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Jan 12 06:14:02 GMT 2025 - 575.5K bytes - Click Count (0)