The following pages link to The Pseudoprimes to 25 ⋅10 9 (Q3887519):
Displaying 50 items.
- Carmichael numbers with \(p+1\mid n+1\) (Q472819) (← links)
- Primality test for numbers of the form \(A p^n + w_n\) (Q491620) (← links)
- Improvements to RSA key generation and CRT on embedded devices (Q826302) (← links)
- On the effectiveness of a generalization of Miller's primality theorem (Q964923) (← links)
- Carmichael's ``Empirical Theorem'' (Q1071040) (← links)
- A nonlinear public key cryptosystem (Q1102923) (← links)
- The generation of random numbers that are probably prime (Q1118632) (← links)
- Arithmetical progressions formed from three different Euler pseudoprimes for the odd base a (Q1157349) (← links)
- Recent developments in primality testing (Q1160213) (← links)
- The influence of computers in the development of number theory (Q1164656) (← links)
- A probable prime test with high confidence (Q1273196) (← links)
- Prime-number algorithm for public-key systems (Q1816016) (← links)
- Short effective intervals containing primes (Q1869779) (← links)
- Primality testing of large numbers in Maple (Q1903747) (← links)
- Building pseudoprimes with a large number of prime factors (Q1919698) (← links)
- The error probability of the Miller-Rabin primality test (Q1992114) (← links)
- Primality tests, linear recurrent sequences and the Pell equation (Q2075076) (← links)
- Strong pseudoprimes to base 2 (Q2097530) (← links)
- An unconditional improvement to the running time of the quadratic Frobenius test (Q2291718) (← links)
- Primitive abundant and weird numbers with many prime factors (Q2631707) (← links)
- Finding strong pseudoprimes to several bases (Q2701572) (← links)
- Frobenius pseudoprimes (Q2701573) (← links)
- Two contradictory conjectures concerning Carmichael numbers (Q2781234) (← links)
- Constructing Carmichael numbers through improved subset-product algorithms (Q2871190) (← links)
- Strong pseudoprimes to twelve prime bases (Q2953216) (← links)
- (Q3024718) (← links)
- The Rabin-Monier theorem for Lucas pseudoprimes (Q3127342) (← links)
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test (Q3147182) (← links)
- Compositeness test with nodal curves (Q3174870) (← links)
- Strong pseudoprimes to the first eight prime bases (Q3189455) (← links)
- Explicit Bounds for Primality Testing and Related Problems (Q3478501) (← links)
- ON CARMICHAEL NUMBERS IN ARITHMETIC PROGRESSIONS (Q3577302) (← links)
- (Q3582591) (← links)
- Two kinds of strong pseudoprimes up to $10^{36}$ (Q3592695) (← links)
- On the Number of Elliptic Pseudoprimes (Q3807278) (← links)
- Lucas Pseudoprimes (Q3907627) (← links)
- On Strong Pseudoprimes to Several Bases (Q4274406) (← links)
- Rabin-Miller Primality Test: Composite Numbers Which Pass It (Q4325735) (← links)
- Density of Carmichael numbers with three prime factors (Q4372644) (← links)
- Finding strong pseudoprimes to several bases. II (Q4417183) (← links)
- Some new kinds of pseudoprimes (Q4452179) (← links)
- The structure factor of primes (Q4642686) (← links)
- Finding 𝐶₃-strong pseudoprimes (Q4654036) (← links)
- On the Distribution of Pseudoprimes (Q4749887) (← links)
- On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-$p$ digits (Q4991646) (← links)
- Strengthening the Baillie-PSW primality test (Q4992237) (← links)
- An Overview of Factoring (Q5019319) (← links)
- Hidden multiscale order in the primes (Q5052739) (← links)
- Some thoughts on pseudoprimes (Q5158641) (← links)
- SYLOW <i>p</i>-PSEUDOPRIMES TO SEVERAL BASES FOR SEVERAL PRIMES <i>p</i> (Q5187729) (← links)
