Struct BruteForceBase

pub struct BruteForceBase;

“Method C” for selecting the base given by Baillie¹.

Try P = 3, 4, 5, ... until Jacobi(D, n) = -1, where D = P^2 - 4Q. Returns the found P, and Q = 1.

R. Baillie, Mathematica code for extra strong Lucas pseudoprimes, https://oeis.org/A217719/a217719.txt

---

1.  ↩

Trait Implementations

impl Clone for BruteForceBase

fn clone(&self) -> BruteForceBase

Returns a duplicate of the value.

const fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for BruteForceBase

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl LucasBase for BruteForceBase

fn generate<T: Integer>( &self, n: &Odd<T>, ) -> Result<(Word, Word, bool), Primality>

Given an odd integer, returns Ok((P, abs(Q), is_negative(Q))) on success, or Err(Primality) if the primality for the given integer was discovered during the search for a base.

impl PartialEq for BruteForceBase

fn eq(&self, other: &BruteForceBase) -> bool

Tests for self and other values to be equal, and is used by ==.

const fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for BruteForceBase

impl Eq for BruteForceBase

impl StructuralPartialEq for BruteForceBase