/ 
Math-Prime-Util-GMP-0.30
River stage one • 2 direct dependents • 7 total dependents

Changes for version 0.30 - 2015-06-15

  • ADDED
    • harmfrac returns (num,den) of Harmonic number
    • harmreal returns float value of Harmonic number
    • is_proth_prime(p) For k*2^n+1, returns -1, 0, or 2
    • is_frobenius_khashin_pseudoprime returns 1 if Frob-Khashin prob prime
  • FIXES
    • lucas sequence with even n fixed.
  • PERFORMANCE
    • A Proth test was added to quickly prove numbers of the form k*2^n+1.
    • LLR testing was improved using a method by Rödseth. This allows proofs of k*2^n-1. The old method is still used, but was unable to quickly test cases where k was divisible by 3. The new method handles these.
    • BLS75-5 proof: use an expanding stack, allowing it to work on inputs like: 'k * n# + 1'.
    • BLS75-5 proof: remove some redundant computations.

Modules

Math::Prime::Util::GMP
Utilities related to prime numbers and factoring, using GMP

Examples

Other files