Pages that link to "Item:Q887438"
From MaRDI portal
The following pages link to Some primality tests that eluded Lucas (Q887438):
Displaying 15 items.
- Explicit primality criteria for \(h \cdot 2^n \pm 1\) (Q284473) (← links)
- Primality tests, linear recurrent sequences and the Pell equation (Q2075076) (← links)
- A primality test for \(4Kp^n-1\) numbers (Q2287882) (← links)
- Generalized Lucas-Lehmer tests using Pell conics (Q2845539) (← links)
- (Q3390087) (← links)
- Divisibity, iterated digit sums, primality tests (Q3632779) (← links)
- A Note on Primality Testing Using Lucas Sequences (Q4056063) (← links)
- (Q4341726) (← links)
- (Q4431807) (← links)
- Higher order pseudoprimes in primality testing (Q4878670) (← links)
- (Q5042431) (← links)
- (Q5053019) (← links)
- (Q5109565) (← links)
- Efficient computation of terms of linear recurrence sequences of any order (Q5384249) (← links)
- A note on public key cryptography based on Williams-Guy functions (Q6546689) (← links)