Home
last modified time | relevance | path

Searched refs:prime (Results 1 – 25 of 4248) sorted by relevance

12345678910>>...170

/dports/math/p5-Bit-Vector/Bit-Vector-7.4/t/
H A D05______primes.t27 $prime[2] = 1;
28 $prime[3] = 1;
29 $prime[5] = 1;
30 $prime[7] = 1;
31 $prime[11] = 1;
32 $prime[13] = 1;
33 $prime[17] = 1;
34 $prime[19] = 1;
35 $prime[23] = 1;
36 $prime[29] = 1;
[all …]
/dports/math/primecount/primecount-7.2/src/
H A DSieve.cpp289 multiple += prime * factor; in add()
305 add(prime); in cross_off()
307 prime /= 30; in cross_off()
344 m += prime * 30 + 1; in cross_off()
369 m += prime * 30 + 7; in cross_off()
394 m += prime * 30 + 11; in cross_off()
419 m += prime * 30 + 13; in cross_off()
444 m += prime * 30 + 17; in cross_off()
469 m += prime * 30 + 19; in cross_off()
537 add(prime); in cross_off_count()
[all …]
/dports/biology/hyphy/hyphy-2.5.33/res/TemplateBatchFiles/SelectionAnalyses/
H A DPRIME.bf100 prime.scaler_prefix = "prime.scaler";
336 …prime.table_headers [3+prime.i*3][0] = "λ" + prime.i; prime.table_headers [3 + prime.i*3][1…
337 …prime.table_headers [4+prime.i*3][0] = "p" + prime.i; prime.table_headers [4 + prime.i*3][1] = "p-…
338 …prime.table_headers [5+prime.i*3][0] = "LogL" + prime.i; prime.table_headers [5 + prime.i*3][1] = …
399 for (prime.partition_index = 0; prime.partition_index < prime.partition_count; prime.partition_inde…
425 prime.alpha, "prime.site_alpha", prime.beta, prime.baseline_non_syn_rate,
510 …prime.partition_matrix = {Abs (prime.site_results[prime.partition_index]), Rows (prime.table_heade…
514 for (prime.index = 0; prime.index < Rows (prime.table_headers); prime.index += 1) {
520 prime.site_results[prime.partition_index] = prime.partition_matrix;
723 function prime.report.echo (prime.report.site, prime.report.partition, prime.report.row) {
[all …]
/dports/math/gap/gap-4.11.0/pkg/liepring-1.9.2/tst/
H A Dmanual.example-4.tst5 [ <LiePRing of dimension 4 over prime p>,
6 <LiePRing of dimension 4 over prime p>,
7 <LiePRing of dimension 4 over prime p>,
8 <LiePRing of dimension 4 over prime p>,
9 <LiePRing of dimension 4 over prime p>,
10 <LiePRing of dimension 4 over prime p>,
11 <LiePRing of dimension 4 over prime p>,
13 <LiePRing of dimension 4 over prime p>,
14 <LiePRing of dimension 4 over prime p>,
15 <LiePRing of dimension 4 over prime p>,
[all …]
H A Dp12345.tst9 [ <LiePRing of dimension 2 over prime p>,
10 <LiePRing of dimension 2 over prime p> ]
20 [ <LiePRing of dimension 3 over prime p>,
21 <LiePRing of dimension 3 over prime p>,
22 <LiePRing of dimension 3 over prime p>,
23 <LiePRing of dimension 3 over prime p>,
24 <LiePRing of dimension 3 over prime p> ]
37 [ <LiePRing of dimension 4 over prime p>,
38 <LiePRing of dimension 4 over prime p>,
39 <LiePRing of dimension 4 over prime p>,
[all …]
/dports/lang/chibi-scheme/chibi-scheme-0.10/lib/chibi/math/
H A Dprime-test.sld7 (test-begin "prime")
14 (test #f (prime? 1))
15 (test #t (prime? 2))
16 (test #t (prime? 3))
17 (test #f (prime? 4))
18 (test #t (prime? 5))
19 (test #f (prime? 6))
20 (test #t (prime? 7))
21 (test #f (prime? 8))
22 (test #f (prime? 9))
[all …]
/dports/devel/p5-Data-Dump-Streamer/Data-Dump-Streamer-2.40/t/
H A Dnames.t92 @prime = (
103 $prime = [
113 @prime = (
132 @prime = (
144 $prime = [
154 @prime = (
204 my @prime = (
216 my $prime = [
227 my @prime = (
248 my @prime = (
[all …]
/dports/math/primesieve/primesieve-7.7/test/
H A Dprev_prime1.cpp34 uint64_t prime; in main() local
39 prime = it.prev_prime(); in main()
44 prime = it.prev_prime(); in main()
50 prime = it.prev_prime(); in main()
54 for (; prime > 0; prime = it.prev_prime()) in main()
55 sum += prime; in main()
62 prime = it.prev_prime(); in main()
64 check(prime == 0); in main()
69 uint64_t old = prime; in main()
88 uint64_t old = prime; in main()
[all …]
H A Dmove_primesieve_iterator.cpp35 for (; prime < 500000000ull; prime = it.next_prime()) in main()
36 sum += prime; in main()
42 for (; prime < 1000000000ull; prime = it2.next_prime()) in main()
43 sum += prime; in main()
53 prime = it.next_prime(); in main()
57 for (; prime < 600000000ull; prime = it.next_prime()) in main()
58 sum += prime; in main()
64 for (; prime < 1000000000ull; prime = it2.next_prime()) in main()
65 sum += prime; in main()
76 check(prime == 997); in main()
[all …]
H A Dnext_prime2.c38 uint64_t prime; in main() local
45 prime = primesieve_next_prime(&it); in main()
47 check(prime == primes[i]); in main()
52 check(prime == primes[i + 1]); in main()
59 sum += prime; in main()
65 prime = primesieve_next_prime(&it); in main()
67 while (prime <= max_prime) in main()
72 old = prime; in main()
75 check(prime == primes[size - i]); in main()
79 prime = primesieve_next_prime(&it); in main()
[all …]
H A Dprev_prime2.c37 uint64_t prime; in main() local
44 prime = primesieve_prev_prime(&it); in main()
46 check(prime == primes[i]); in main()
51 check(prime == primes[i - 1]); in main()
58 sum += prime; in main()
67 check(prime == 0); in main()
72 old = prime; in main()
75 check(prime == primes[i]); in main()
86 check(prime == p2); in main()
91 old = prime; in main()
[all …]
H A Dnext_prime1.cpp34 uint64_t prime; in main() local
39 prime = it.next_prime(); in main()
44 prime = it.next_prime(); in main()
50 prime = it.next_prime(); in main()
54 for (; prime < 1000000000; prime = it.next_prime()) in main()
55 sum += prime; in main()
61 prime = it.next_prime(); in main()
64 prime = it.next_prime(); in main()
68 uint64_t old = prime; in main()
70 prime = it.prev_prime(); in main()
[all …]
/dports/math/primecount/primecount-7.2/lib/primesieve/test/
H A Dprev_prime1.cpp34 uint64_t prime;
39 prime = it.prev_prime();
44 prime = it.prev_prime();
50 prime = it.prev_prime();
54 for (; prime > 0; prime = it.prev_prime())
55 sum += prime;
62 prime = it.prev_prime();
64 check(prime == 0);
69 uint64_t old = prime;
88 uint64_t old = prime;
[all …]
H A Dmove_primesieve_iterator.cpp35 for (; prime < 500000000ull; prime = it.next_prime())
36 sum += prime;
42 for (; prime < 1000000000ull; prime = it2.next_prime())
43 sum += prime; in bad_isqrt()
53 prime = it.next_prime();
57 for (; prime < 600000000ull; prime = it.next_prime())
58 sum += prime;
64 for (; prime < 1000000000ull; prime = it2.next_prime())
65 sum += prime;
76 check(prime == 997);
[all …]
H A Dnext_prime2.c38 uint64_t prime; in main()
45 prime = primesieve_next_prime(&it); in main()
47 check(prime == primes[i]); in main()
52 check(prime == primes[i + 1]); in main()
59 sum += prime; in main()
65 prime = primesieve_next_prime(&it); in main()
67 while (prime <= max_prime) in main()
72 old = prime; in main()
75 check(prime == primes[size - i]); in main()
79 prime = primesieve_next_prime(&it); in main()
[all …]
H A Dprev_prime2.c37 uint64_t prime; in main()
44 prime = primesieve_prev_prime(&it); in main()
46 check(prime == primes[i]); in main()
51 check(prime == primes[i - 1]); in main()
58 sum += prime; in main()
67 check(prime == 0); in main()
72 old = prime; in main()
75 check(prime == primes[i]); in main()
86 check(prime == p2); in main()
91 old = prime; in main()
[all …]
H A Dnext_prime1.cpp34 uint64_t prime; in main()
39 prime = it.next_prime(); in main()
44 prime = it.next_prime(); in main()
50 prime = it.next_prime(); in main()
54 for (; prime < 1000000000; prime = it.next_prime()) in main()
55 sum += prime; in main()
61 prime = it.next_prime(); in main()
64 prime = it.next_prime(); in main()
68 uint64_t old = prime; in main()
70 prime = it.prev_prime(); in main()
[all …]
/dports/lang/ruby26/ruby-2.6.9/spec/ruby/library/prime/
H A Deach_spec.rb25 ScratchPad << prime
27 previous = prime
32 all_prime &&= (2..Math.sqrt(prime)).all? { |d| prime % d != 0 }
71 @object.each { |prime| break prime }.should == 2
108 (2..Math.sqrt(prime)).all? { |d| prime % d != 0 }
111 ScratchPad.recorded.all? { |prime| prime <= bound }.should be_true
119 @object.each(10) { |prime| prime }.should == 7
120 @object.each(10) { |prime| break prime }.should == 2
128 @object.each(100, generator) { |prime| ScratchPad << prime }
164 @object.each { |prime| break if prime > 10 }
[all …]
/dports/math/gap/gap-4.11.0/pkg/liepring-1.9.2/doc/
H A Ddatabase.tex56 [ <LiePRing of dimension 4 over prime p>,
57 <LiePRing of dimension 4 over prime p>,
58 <LiePRing of dimension 4 over prime p>,
59 <LiePRing of dimension 4 over prime p>,
60 <LiePRing of dimension 4 over prime p>,
61 <LiePRing of dimension 4 over prime p>,
109 $4$ for the prime $7$.
175 the special prime <P>; this may be due to the conditions on the prime or
287 <LiePRing of dimension 7 over prime 5>
300 <LiePRing of dimension 7 over prime p>
[all …]
/dports/devel/gdb/gdb-11.1/gdb/testsuite/gdb.fortran/
H A Dshort-circuit-argument-list.exp35 set prime 17
39 global prime
41 gdb_test_no_output "set var calls%function_${counter}_called=$prime"
72 … = $prime, function_no_arg_false_called = $prime, function_one_arg_called = $prime, function_two_a…
82 …prime + 1], function_no_arg_false_called = $prime, function_one_arg_called = [expr $prime + 1], fu…
89 …prime + 1], function_no_arg_false_called = $prime, function_one_arg_called = [expr $prime + 2], fu…
130 gdb_test "p calls%function_one_arg_called" " = $prime"
138 gdb_test "p calls%function_array_called" " = $prime"
/dports/math/gfan/gfan0.6.2/src/
H A Dpadic.cpp67 if(omegaDegree(i,prime,omega)<d) in pAdicInitialForm()
91 int aD=omegaDegree(a,prime,omega); in GReater()
92 int bD=omegaDegree(b,prime,omega); in GReater()
193 FieldZModPZ residueField(prime); in longDivision()
216 … if(SM(T[ii],prime,omega,tieBreaker).exponent.divides(SM(q,prime,omega,tieBreaker).exponent)) in longDivision()
261 Term cuxu=ST(q,prime,omega,tieBreaker)/ST(g,prime,omega,tieBreaker); in longDivision()
279 …assert(GReater(ST(p,prime,omega,tieBreaker),ST(b*q,prime,omega,tieBreaker),prime,omega,tieBreaker)… in longDivision()
331 …assert(!GReater(ST(u*f,prime,omega,tieBreaker),ST(r,prime,omega,tieBreaker),prime,omega,tieBreaker… in longDivision()
336 …assert(!GReater(ST(u*f,prime,omega,tieBreaker),ST((*i)*(*j),prime,omega,tieBreaker),prime,omega,ti… in longDivision()
355 return (lcm/ST(a,prime,omega,tieBreaker))*a-(lcm/ST(b,prime,omega,tieBreaker))*b; in SPolynomial()
[all …]
/dports/math/gfanlib/gfan0.6.2/src/
H A Dpadic.cpp67 if(omegaDegree(i,prime,omega)<d) in pAdicInitialForm()
91 int aD=omegaDegree(a,prime,omega); in GReater()
92 int bD=omegaDegree(b,prime,omega); in GReater()
193 FieldZModPZ residueField(prime); in longDivision()
216 … if(SM(T[ii],prime,omega,tieBreaker).exponent.divides(SM(q,prime,omega,tieBreaker).exponent)) in longDivision()
261 Term cuxu=ST(q,prime,omega,tieBreaker)/ST(g,prime,omega,tieBreaker); in longDivision()
279 …assert(GReater(ST(p,prime,omega,tieBreaker),ST(b*q,prime,omega,tieBreaker),prime,omega,tieBreaker)… in longDivision()
331 …assert(!GReater(ST(u*f,prime,omega,tieBreaker),ST(r,prime,omega,tieBreaker),prime,omega,tieBreaker… in longDivision()
336 …assert(!GReater(ST(u*f,prime,omega,tieBreaker),ST((*i)*(*j),prime,omega,tieBreaker),prime,omega,ti… in longDivision()
355 return (lcm/ST(a,prime,omega,tieBreaker))*a-(lcm/ST(b,prime,omega,tieBreaker))*b; in SPolynomial()
[all …]
/dports/math/gap/gap-4.11.0/pkg/guava-3.15/src/leon/src/
H A Dfactor.c43 a->prime[a->noOfFactors] = b->prime[b->noOfFactors] = MAX_INT; in factMultiply()
44 while ( a->prime[aIndex] < MAX_INT || b->prime[bIndex] < MAX_INT ) in factMultiply()
45 if ( a->prime[aIndex] < b->prime[bIndex] ) in factMultiply()
47 else if ( a->prime[aIndex] == b->prime[bIndex] ) in factMultiply()
52 a->prime[i] = a->prime[i-1]; in factMultiply()
55 a->prime[aIndex] = b->prime[bIndex]; in factMultiply()
76 a->prime[a->noOfFactors] = b->prime[b->noOfFactors] = MAX_INT; in factDivide()
77 while ( a->prime[aIndex] < MAX_INT && b->prime[bIndex] < MAX_INT ) in factDivide()
78 if ( a->prime[aIndex] < b->prime[bIndex] ) in factDivide()
80 else if ( a->prime[aIndex] == b->prime[bIndex] ) in factDivide()
[all …]
/dports/lang/racket/racket-8.3/share/pkgs/math-lib/math/private/number-theory/
H A Dnumber-theory.rkt15 nth-prime
16 random-prime
17 next-prime untyped-next-prime
19 prev-prime untyped-prev-prime
21 prime?
22 odd-prime?
194 (define prime?
331 (define (small-prime-factors-over n p) ; p prime
728 (check-equal? (prime-fermat? 5) 'possibly-prime)
729 (check-equal? (prime-fermat? 7) 'possibly-prime)
[all …]
/dports/math/gap/gap-4.11.0/pkg/liepring-1.9.2/lib/dim7/3gen/notes/
H A Dnotes6.163.tex68 pa^{\prime } &=&\frac{\lambda }{\alpha \delta }b^{\prime }a^{\prime
69 }a^{\prime }+\frac{\mu }{\delta ^{2}}b^{\prime }a^{\prime }b^{\prime }, \\
70 pb^{\prime } &=&\frac{\nu }{\alpha ^{2}}b^{\prime }a^{\prime }a^{\prime }+%
71 \frac{\xi }{\alpha \delta }b^{\prime }a^{\prime }b^{\prime }
81 pa^{\prime } &=&\frac{\xi }{\alpha \delta }b^{\prime }a^{\prime }a^{\prime }+%
82 \frac{\nu }{\delta ^{2}}b^{\prime }a^{\prime }b^{\prime }, \\
83 pb^{\prime } &=&\frac{\mu }{\alpha ^{2}}b^{\prime }a^{\prime }a^{\prime }+%
84 \frac{\lambda }{\alpha \delta }b^{\prime }a^{\prime }b^{\prime }.
121 c^{\prime } &=&c,
128 c^{\prime } &=&c,
[all …]

12345678910>>...170