Struct SelfridgeBase

pub struct SelfridgeBase;

“Method A” for selecting the base given in Baillie & Wagstaff¹, attributed to Selfridge.

Try D = 1 - 4Q = 5, -7, 9, -11, 13, ... until Jacobi(D, n) = -1. Return P = 1, Q = (1 - D) / 4).

R. Baillie, S. S. Wagstaff, “Lucas pseudoprimes”, Math. Comp. 35 1391-1417 (1980), DOI: 10.2307/2006406, http://mpqs.free.fr/LucasPseudoprimes.pdf

---

1.  ↩

Trait Implementations

impl Clone for SelfridgeBase

fn clone(&self) -> SelfridgeBase

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SelfridgeBase

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

Formats the value using the given formatter.

impl LucasBase for SelfridgeBase

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 SelfridgeBase

fn eq(&self, other: &SelfridgeBase) -> 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 SelfridgeBase

impl Eq for SelfridgeBase

impl StructuralPartialEq for SelfridgeBase