Home
last modified time | relevance | path

Searched refs:Gcd (Results 176 – 200 of 797) sorted by relevance

12345678910>>...32

/dports/security/libadacrypt/Ada-Crypto-Library-abc534f/src/
H A Dcrypto-asymmetric-rsa.adb65 or X.P*X.Q /= X.N or (X.P-1)*(X.Q-1) /= X.Phi or Gcd(X.D, X.P) /= 1
66 or Gcd(X.D, X.Q) /= Big_Unsigned_One then
94 exit when Gcd(Public_Key.E, Private_Key.Phi) = Big_Unsigned_One;
102 exit when Gcd(Public_Key.E, Private_Key.Phi) =
/dports/math/gap/gap-4.11.0/pkg/FactInt-1.6.3/lib/
H A Decm.gi124 p := Gcd(a^2 - 4,n);
143 p := Gcd(Point[2],n);
164 p := Gcd(PowerTable[i][2],n);
187 p := Gcd(StepPower[2],n);
206 p := Gcd(BufProd,n);
270 else p := Gcd(a2,n); fi;
/dports/math/gap/gap-4.11.0/tst/testinstall/
H A Dratfun.tst146 gap> Gcd(t-2,t^2-2*t);
163 gap> Gcd(DefaultRing(f),f,g);
165 gap> Gcd(f,g);
/dports/math/gap/gap-4.11.0/lib/
H A Dgrpffmat.gi414 rep := List([1..Gcd(q-1, n)-1], i-> IdentityMat(n, GF(q)));
415 for i in [1..Gcd(q-1, n)-1] do
437 gcd := Gcd(Concatenation(List(a, b-> b[4])));
438 gcd := Gcd(gcd, q-1);
568 return Sum(Cartesian(DivisorsInt(Gcd( f,q - 1)),
569 DivisorsInt(Gcd(n/f,q - 1))),
601 * NrConjugacyClassesGL(n/Product(d),q)/(q - 1))/Gcd(n,q - 1);
626 return Sum(Cartesian(DivisorsInt(Gcd( f,q + 1)),
627 DivisorsInt(Gcd(n/f,q + 1))),
659 * NrConjugacyClassesGU(n/Product(d),q)/(q + 1))/Gcd(n,q + 1);
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A DAlgebraic_structure_traits.h73 typedef Null_functor Gcd; typedef
114 typedef Null_functor Gcd; typedef
219 typename AST::Gcd gcd; in operator()
272 class Gcd
/dports/math/gap/gap-4.11.0/pkg/recog-1.3.2/contrib/akos/
H A Dchar2sl.g15 yy:=y^(order/Gcd(order,q-1));
23 yyy:=y^(Gcd(order,q-1));
H A Dchar2ver2.g15 yy:=y^(order/Gcd(order,q-1));
23 yyy:=y^(Gcd(order,q-1));
/dports/net-im/matterbridge/matterbridge-1.22.3/vendor/github.com/yaegashi/msgraph.go/beta/
H A DRequestWorkbookFunctionsGcd.go11 func (b *WorkbookFunctionsRequestBuilder) Gcd(reqObj *WorkbookFunctionsGcdRequestParameter) *Workbo… func
/dports/math/fricas/fricas-1.3.7/src/algebra/
H A Dmuldep.spad2 ++ Gcd basis
6 ++ Gcd basis provides functions to find structure of multiplicative
7 ++ group (and semigroup) generated by elements of Gcd domain.
/dports/www/ilias/ILIAS-5.4.25/libs/composer/vendor/phpoffice/phpspreadsheet/src/PhpSpreadsheet/Calculation/MathTrig/
H A DGcd.php8 class Gcd class
/dports/math/sympol/SymPol-0.1.9/external/lrslib-042c/
H A Dlrslib.c814 lrs_mp_vector Gcd, Lcm; in lrs_read_dic() local
824 Gcd = Q->Gcd; in lrs_read_dic()
833 itomp (ONE, Gcd[0]); in lrs_read_dic()
857 storesign (Gcd[i], POS); in lrs_read_dic()
873 itomp (ONE, Gcd[i]); in lrs_read_dic()
3962 lrs_clear_mp_vector (Q->Gcd,m); in lrs_free_dat()
4086 Q->Gcd = lrs_alloc_mp_vector(m); in lrs_alloc_dic()
4357 lrs_mp_vector Gcd, Lcm; in lrs_set_row_mp() local
4365 Gcd = Q->Gcd; in lrs_set_row_mp()
4394 storesign (Gcd[i], POS); in lrs_set_row_mp()
[all …]
/dports/security/cryptopp/cryptopp-8.6.0/
H A Delgamal.h233 CRYPTOPP_ASSERT(Integer::Gcd(x, q) == Integer::One()); in Validate()
234 pass = pass && Integer::Gcd(x, q) == Integer::One(); in Validate()
/dports/emulators/citra-qt5/citra-ac98458e0/externals/cryptopp/cryptopp/
H A Delgamal.h233 CRYPTOPP_ASSERT(Integer::Gcd(x, q) == Integer::One()); in Validate()
234 pass = pass && Integer::Gcd(x, q) == Integer::One(); in Validate()
/dports/emulators/citra/citra-ac98458e0/externals/cryptopp/cryptopp/
H A Delgamal.h233 CRYPTOPP_ASSERT(Integer::Gcd(x, q) == Integer::One()); in Validate()
234 pass = pass && Integer::Gcd(x, q) == Integer::One(); in Validate()
/dports/sysutils/fusefs-securefs/securefs-0.12.0/external/cryptopp/
H A Delgamal.h233 CRYPTOPP_ASSERT(Integer::Gcd(x, q) == Integer::One()); in Validate()
234 pass = pass && Integer::Gcd(x, q) == Integer::One(); in Validate()
/dports/www/ilias/ILIAS-5.4.25/libs/composer/vendor/phpoffice/phpspreadsheet/src/PhpSpreadsheet/Style/NumberFormat/
H A DFractionFormatter.php20 $GCD = MathTrig\Gcd::evaluate($decimalPart, $decimalDivisor);
/dports/math/gap/gap-4.11.0/pkg/SymbCompCC-1.3.1/gap/PPowerPoly/
H A Dppowerpolyloc.gi65 gcd_n := Gcd( ec1_num );
66 gcd_d := Gcd( ec2_num );
68 gcd := Gcd( gcd_d, gcd_n );
125 gcd_n := Gcd( ec1_num );
126 gcd_d := Gcd( ec2_num );
128 gcd := Gcd( gcd_d, gcd_n );
/dports/math/gap/gap-4.11.0/pkg/Gauss-2019.09.02/gap/
H A DHermiteSparse.gi69 min := [ i, Gcd( Int( entries[ row_indices[i] ][ 1 ] ), char ) ];
72 g := Gcd( Int( entries[ row_indices[i] ][ 1 ] ), char );
194 min := [ i, Gcd( Int( entries[ row_indices[i] ][ 1 ] ), char ) ];
198 g := Gcd( Int( entries[ row_indices[i] ][ 1 ] ), char );
486 min := [ i, Gcd( Int( entries[ row_indices[i] ][ 1 ] ), char ) ];
489 g := Gcd( Int( entries[ row_indices[i] ][ 1 ] ), char );
/dports/math/yacas/yacas-1.9.1/scripts/numbers.rep/
H A DNumberTheory.ys92 gcd := Gcd(n,k);
106 18 # JacobiSymbol(_a, _b) _ (Gcd(a,b)>1) <-- 0;
/dports/math/cgal/CGAL-5.3/examples/Polynomial/
H A Dgcd_up_to_constant_factor.cpp11 PT_1::Gcd gcd; in main()
/dports/security/rustscan/RustScan-2.0.1/cargo-crates/gcd-2.0.1/benches/
H A Dgcd_benchmark.rs7 use gcd::Gcd;
/dports/math/gap/gap-4.11.0/pkg/liepring-1.9.2/gap/
H A Dvalsfun.gi149 if Length(e) <> P^2 + (P+1)/2 - Gcd(P-1,4)/2 then
224 f := (Gcd(P-1,3)*(P^2+3*P+11)+1)/2;
259 f := ((Gcd(P-1,3) * (P^2+P+1))+5)/2;
753 l := (P+1+(P+3)*Gcd(P-1,3)+Gcd(P-1,4))/2;
803 l := 3*P + 3 + (P^2+2*P+3)*Gcd(P-1,3)/2;
914 l := (P+1+(P+3)*Gcd(P-1,3)+Gcd(P-1,4))/2;
950 l := 3+Gcd(P-1,3)*(P+3+Gcd(P-1,4))/4;
986 l := 2+Gcd(P-1,3)*(P+7-Gcd(P-1,4))/4;
1024 l := (5*P-7+(P^2-5)*Gcd(P-1,3)-Gcd(P-1,4))/2;
1360 l := P-3+Gcd(P-1,4)/2;
[all …]
/dports/math/yacas/yacas-1.9.1/scripts/factors.rep/
H A Dbinaryfactors.ys64 Set(lgcd,Gcd({andiv,an,root}));
94 Set(gcd,Gcd(poly));
128 // Set(testpoly,Mkc(Div(polynom,Monic(Gcd(polynom,Deriv(var)polynom))),var));
/dports/math/yacas/yacas-1.9.1/scripts/stubs.rep/
H A Dom.ys9 OMDef( "Gcd", "arith1","gcd" );
/dports/math/maxima/maxima-5.43.2/share/algebra/charsets/
H A DREADME37 [Gcd, RootOf, charsets_die, charsets_dieA, coeffs, complexity,
53 * Gcd and RootOf are only referenced in charsets_Malgcd which is

12345678910>>...32