| /dports/net/zmap/zmap-2.1.1/src/ |
| H A D | cyclic.c | 61 .prime_factors = {2},
67 .prime_factors = {2},
73 .prime_factors = {2, 23, 103, 3541},
79 .prime_factors = {2, 3, 19, 87211},
85 .prime_factors = {2, 3, 5, 131, 364289},
97 if (group->prime_factors[i] > check && !(group->prime_factors[i] % check)) { in check_coprime()
99 } else if (group->prime_factors[i] < check && !(check % group->prime_factors[i])) { in check_coprime()
101 } else if (group->prime_factors[i] == check) { in check_coprime()
|
| H A D | cyclic.h | 22 uint64_t prime_factors[10]; // Unique prime factors of (p-1) member
|
| /dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/sieve/ |
| H A D | las-todo-entry.hpp | 27 std::vector<uint64_t> prime_factors; member
28 bool is_prime() const { return prime_factors.size() == 1; } in is_prime()
53 …const & p, cxx_mpz const & r, const int side, std::vector<uint64_t> & prime_factors, const int dep… in las_todo_entry()
54 p(p), r(r), side(side), prime_factors(prime_factors), depth(depth), iteration(iteration) in las_todo_entry()
59 for(auto x : prime_factors) in las_todo_entry()
70 for (auto p : prime_factors) { in is_coprime_to()
|
| H A D | las-todo-entry.cpp | 13 prime_factors.clear(); in find_prime_factors()
26 prime_factors.push_back(mpz_get_uint64(p)); in find_prime_factors()
28 prime_factors.push_back(0); in find_prime_factors()
50 prime_factors.push_back(f); in find_prime_factors()
53 prime_factors.push_back(mpz_get_ui(pp)); in find_prime_factors()
70 for(auto const & p : doing.prime_factors) { in operator <<()
120 doing.prime_factors.push_back(g); in operator >>()
122 if (doing.prime_factors.empty()) in operator >>()
|
| H A D | las-cofac-standalone.cpp | 66 for (auto const& facq : E.prime_factors) { in gcd_coprime_with_q()
74 for (auto const& facq : E.prime_factors) { in gcd_coprime_with_q()
123 for (auto const& facq : doing.prime_factors) in get_relation()
|
| H A D | las-qlattice.hpp | 33 for (auto const & p : doing.prime_factors) in is_coprime_to()
|
| H A D | las-duplicate.cpp | 187 for (auto const & f : doing.prime_factors) in subtract_fb_log()
306 for (auto const & f : doing.prime_factors) in sq_finds_relation()
|
| /dports/math/singular/Singular-Release-4-2-1/factory/ |
| H A D | cf_cyclo.cc | 111 int* prime_factors; in cyclotomicPoly() local
114 prime_factors= integerFactorizer (n, prime_factors_length, fail); in cyclotomicPoly()
115 int* distinct_factors= makeDistinct (prime_factors, prime_factors_length, in cyclotomicPoly()
117 delete [] prime_factors; in cyclotomicPoly()
|
| /dports/multimedia/gstreamer1-plugins-rust/gst-plugins-rs-d0466b3eee114207f851b37cae0015c0e718f021/cargo-crates/rustfft-5.1.1/src/ |
| H A D | math_utils.rs | 521 fn assert_internally_consistent(prime_factors: &PrimeFactors) { in assert_internally_consistent()
526 if prime_factors.get_power_of_two() > 0 { in assert_internally_consistent()
527 cumulative_product <<= prime_factors.get_power_of_two(); in assert_internally_consistent()
529 discovered_total_factors += prime_factors.get_power_of_two(); in assert_internally_consistent()
531 if prime_factors.get_power_of_three() > 0 { in assert_internally_consistent()
532 cumulative_product *= 3.pow(prime_factors.get_power_of_three()); in assert_internally_consistent()
534 discovered_total_factors += prime_factors.get_power_of_three(); in assert_internally_consistent()
536 for factor in prime_factors.get_other_factors() { in assert_internally_consistent()
543 assert_eq!(prime_factors.get_product(), cumulative_product); in assert_internally_consistent()
545 prime_factors.get_distinct_factor_count(), in assert_internally_consistent()
[all …]
|
| /dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/bench/ |
| H A D | bench-factor.pl | 33 …verify_factor($p, [prime_factors($p)], [factor($p)], "Math::Prime::Util $Math::Prime::Util::VERSIO…
46 "MFXS random" => sub { my@a=prime_factors($_) for @rnd },
47 "MFXS nonsmooth" => sub { my@a=prime_factors($_) for @smp },
|
| H A D | bench-factor-semiprime.pl | 63 my @factors = prime_factors($sp);
81 'MFXS' => sub { do { my @f = prime_factors($_) } for @semiprimes; },
|
| /dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/xt/ |
| H A D | test-factor-mpxs.pl | 20 my @mfxs = prime_factors($n);
35 my @mfxs = prime_factors($n);
|
| /dports/databases/py-postgresql/py-postgresql-1.1.0/postgresql/test/ |
| H A D | test_python.py | 49 element.RecursiveFactor, list, element.prime_factors(x)
54 element.RecursiveFactor, list, element.prime_factors(y)
57 element.RecursiveFactor, list, element.prime_factors(x)
61 self.assertEqual(list(element.prime_factors(z)), [
|
| /dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/t/ |
| H A D | 50-factoring.t | 88 my %prime_factors = (
115 + 2*scalar(keys %prime_factors)
142 while (my($n, $factors) = each(%prime_factors)) {
|
| /dports/science/py-pymatgen/pymatgen-2022.0.15/pymatgen/analysis/chemenv/utils/ |
| H A D | math_utils.py | 49 def prime_factors(n): function
57 l = prime_factors(n / i)
70 p = prime_factors(n)
|
| /dports/math/curv/curv-0.5/ideas/lib/old/ |
| H A D | fold | 53 // ditto for prime_factors: temp variable works, but parallel update is better
54 prime_factors(n) =
|
| /dports/sysutils/czkawka/czkawka-3.3.1/cargo-crates/rustfft-3.0.1/src/ |
| H A D | plan.rs | 73 let factors = math_utils::prime_factors(len); in plan_fft()
211 let factors = math_utils::prime_factors(inner_fft_len); in plan_prime()
|
| H A D | math_utils.rs | 139 pub fn prime_factors(mut n: usize) -> Vec<usize> { in prime_factors() function
|
| /dports/astro/gpsd/gpsd-3.20/devtools/ |
| H A D | easyinverse.pl | 92 @factors = prime_factors(abs($det));
|
| /dports/devel/vexcl/vexcl-1.4.3/vexcl/fft/ |
| H A D | plan.hpp | 81 inline std::vector<pow> prime_factors(size_t n) { in prime_factors() function
131 std::vector<pow> out, factors = prime_factors(n); in factor()
384 auto fs = prime_factors(*n); in desc()
|
| /dports/databases/py-postgresql/py-postgresql-1.1.0/postgresql/python/ |
| H A D | element.py | 104 def prime_factors(obj): function
|
| /dports/math/symengine/symengine-0.8.1/symengine/ |
| H A D | ntheory.h | 99 void prime_factors(std::vector<RCP<const Integer>> &primes, const Integer &n);
|
| H A D | ntheory.cpp | 429 void prime_factors(std::vector<RCP<const Integer>> &prime_list, in prime_factors() function
641 prime_factors(primes, *integer(p - 1)); in _primitive_root()
|
| /dports/math/zn_poly/zn_poly-0.9.2/demo/bernoulli/ |
| H A D | bernoulli.c | 63 prime_factors (ulong* res, ulong n) in prime_factors() function
99 num_factors = prime_factors (factors, p - 1); in primitive_root()
|
| /dports/math/clfft/clFFT-2.12.2/src/scripts/perf/ |
| H A D | measurePerformance.py | 381 prime_factors = findFactors(relement)
382 if validateFactors(prime_factors) == True:
|