Home
last modified time | relevance | path

Searched refs:Primes (Results 1 – 25 of 1642) sorted by relevance

12345678910>>...66

/dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/math/
H A Dpermutation.cpp2763 { Primes[ 0], FaurePermutationValues + 0 },
2764 { Primes[ 1], FaurePermutationValues + 2 },
2765 { Primes[ 2], FaurePermutationValues + 5 },
2766 { Primes[ 3], FaurePermutationValues + 10 },
2767 { Primes[ 4], FaurePermutationValues + 17 },
2768 { Primes[ 5], FaurePermutationValues + 28 },
2769 { Primes[ 6], FaurePermutationValues + 41 },
2770 { Primes[ 7], FaurePermutationValues + 58 },
2771 { Primes[ 8], FaurePermutationValues + 77 },
2772 { Primes[ 9], FaurePermutationValues + 100 },
[all …]
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/primes/
H A DPrimesTest.java63 Primes.primeFactors(n); in assertPrimeFactorsException()
74 Primes.nextPrime(n); in assertNextPrimeException()
87 Assert.assertEquals(2, Primes.nextPrime(0)); in testNextPrime()
88 Assert.assertEquals(2, Primes.nextPrime(1)); in testNextPrime()
89 Assert.assertEquals(2, Primes.nextPrime(2)); in testNextPrime()
90 Assert.assertEquals(3, Primes.nextPrime(3)); in testNextPrime()
91 Assert.assertEquals(5, Primes.nextPrime(4)); in testNextPrime()
92 Assert.assertEquals(5, Primes.nextPrime(5)); in testNextPrime()
117 Assert.assertFalse(Primes.isPrime(i)); in testIsPrime()
120 Assert.assertFalse(Primes.isPrime(i)); in testIsPrime()
[all …]
/dports/math/givaro/givaro-4.1.1/examples/Polynomial/
H A DPolynomialCRT.C59 VScal Moduli( Primes.size() ); in tmain()
76 CRTSystem CRT( F, Primes, "X" ); in tmain()
84 if (Primes.size() < 14) { in tmain()
85 i = Primes.begin(); in tmain()
95 VScal Verifs( Primes.size() ); in tmain()
140 VScal Moduli( Primes.size() ); in tmainext()
152 for(typename VScal::const_iterator it=Primes.begin(); it!=Primes.end();++it) in tmainext()
158 CRTSystem CRT( F, Primes, "X" ); in tmainext()
166 if (Primes.size() < 14) { in tmainext()
167 i = Primes.begin(); in tmainext()
[all …]
/dports/java/bouncycastle15/crypto-169/core/src/test/java/org/bouncycastle/math/test/
H A DPrimesTest.java12 import org.bouncycastle.math.Primes;
13 import org.bouncycastle.math.Primes.MROutput;
14 import org.bouncycastle.math.Primes.STOutput;
33 assertFalse(Primes.hasAnySmallFactors(prime)); in testHasAnySmallFactors()
36 for (int smallFactor = 2; smallFactor <= Primes.SMALL_FACTOR_LIMIT; ++smallFactor) in testHasAnySmallFactors()
39 assertTrue(Primes.hasAnySmallFactors(nonPrimeWithSmallFactor)); in testHasAnySmallFactors()
50 MROutput mr = Primes.enhancedMRProbablePrimeTest(prime, R, mrIterations); in testEnhancedMRProbablePrime()
61 MROutput mr2 = Primes.enhancedMRProbablePrimeTest(primePower, R, mrIterations); in testEnhancedMRProbablePrime()
80 assertTrue(Primes.isMRProbablePrime(prime, R, mrIterations)); in testMRProbablePrime()
83 assertFalse(Primes.isMRProbablePrime(nonPrime, R, mrIterations)); in testMRProbablePrime()
[all …]
/dports/math/gap/gap-4.11.0/pkg/hap-1.25/lib/NonabelianTensor/
H A DSBG.gi6 local H2,Primes, p, S,M,N,ans,T,K,KS,L,x,y;
10 Primes:=SSortedList(Factors(Product(AbelianInvariants(G))));
11 Primes:=Filtered(Primes, i->not i=1);
13 for p in Primes do
44 local H2,Primes, p, S,M,N,ans,T,K,KS,L,x,y;
48 Primes:=SSortedList(Factors(Product(AbelianInvariants(G))));
49 Primes:=Filtered(Primes, i->not i=1);
51 for p in Primes do
/dports/devel/cc65/cc65-2.19/src/common/
H A Dalignment.c52 static const unsigned char Primes[] = { variable
60 #define PRIME_COUNT (sizeof (Primes) / sizeof (Primes[0]))
61 #define LAST_PRIME ((unsigned long)Primes[PRIME_COUNT-1])
120 unsigned long Tmp = Value / Primes[I]; in Factorize()
121 if (Tmp * Primes[I] == Value) { in Factorize()
162 Res *= Primes[I]; in LeastCommonMultiple()
/dports/lang/gcc12-devel/gcc-12-20211205/libgo/go/crypto/rsa/
H A Drsa.go125 if len(priv.Primes) != len(xx.Primes) {
128 for i := range priv.Primes {
129 if priv.Primes[i].Cmp(xx.Primes[i]) != 0 {
338 priv.Primes = primes
469 priv.Precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
471 r := new(big.Int).Mul(priv.Primes[0], priv.Primes[1])
474 prime := priv.Primes[i]
539 m.Add(m, priv.Primes[0])
542 m.Mod(m, priv.Primes[0])
543 m.Mul(m, priv.Primes[1])
[all …]
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/crypto/rsa/
H A Drsa.go125 if len(priv.Primes) != len(xx.Primes) {
128 for i := range priv.Primes {
129 if priv.Primes[i].Cmp(xx.Primes[i]) != 0 {
338 priv.Primes = primes
469 priv.Precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
471 r := new(big.Int).Mul(priv.Primes[0], priv.Primes[1])
474 prime := priv.Primes[i]
539 m.Add(m, priv.Primes[0])
542 m.Mod(m, priv.Primes[0])
543 m.Mul(m, priv.Primes[1])
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/libgo/go/crypto/rsa/
H A Drsa.go125 if len(priv.Primes) != len(xx.Primes) {
128 for i := range priv.Primes {
129 if priv.Primes[i].Cmp(xx.Primes[i]) != 0 {
338 priv.Primes = primes
469 priv.Precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
471 r := new(big.Int).Mul(priv.Primes[0], priv.Primes[1])
474 prime := priv.Primes[i]
539 m.Add(m, priv.Primes[0])
542 m.Mod(m, priv.Primes[0])
543 m.Mul(m, priv.Primes[1])
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libgo/go/crypto/rsa/
H A Drsa.go125 if len(priv.Primes) != len(xx.Primes) {
128 for i := range priv.Primes {
129 if priv.Primes[i].Cmp(xx.Primes[i]) != 0 {
338 priv.Primes = primes
469 priv.Precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
471 r := new(big.Int).Mul(priv.Primes[0], priv.Primes[1])
474 prime := priv.Primes[i]
539 m.Add(m, priv.Primes[0])
542 m.Mod(m, priv.Primes[0])
543 m.Mul(m, priv.Primes[1])
[all …]
/dports/lang/gcc11/gcc-11.2.0/libgo/go/crypto/rsa/
H A Drsa.go125 if len(priv.Primes) != len(xx.Primes) {
128 for i := range priv.Primes {
129 if priv.Primes[i].Cmp(xx.Primes[i]) != 0 {
338 priv.Primes = primes
469 priv.Precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
471 r := new(big.Int).Mul(priv.Primes[0], priv.Primes[1])
474 prime := priv.Primes[i]
539 m.Add(m, priv.Primes[0])
542 m.Mod(m, priv.Primes[0])
543 m.Mul(m, priv.Primes[1])
[all …]
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/lang/gcc9/gcc-9.4.0/gcc/ada/libgnat/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/lang/gcc6-aux/bootstrap/lib/gcc/x86_64-aux-dragonfly4.1/5.1.0/adainclude/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ada/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/devel/avr-gcc/gcc-10.2.0/gcc/ada/libgnat/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ada/libgnat/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/lang/gnat_util/gcc-6-20180516/gcc/ada/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/ada/libgnat/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/lang/gcc48/gcc-4.8.5/gcc/ada/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/ada/libgnat/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/ada/libgnat/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ada/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-coprnu.adb41 I := Primes'Last - Primes'First;
42 Index := Primes'First;
47 if Primes (K) < Hash_Type (Length) then
55 return Primes (Index);

12345678910>>...66