Pages that link to "Item:Q1897680"
From MaRDI portal
The following pages link to Prime numbers and computer methods for factorization. (Q1897680):
Displaying 40 items.
- Efficient computer search of large-order multiple recursive pseudo-random number generators (Q421831) (← links)
- Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus (Q597246) (← links)
- On the primes with \(p_{n+1}-p_n=8\) and the sum of their reciprocals (Q854461) (← links)
- Wave packet transforms over finite cyclic groups (Q891529) (← links)
- ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
- Recent developments in primality proving (Q1297591) (← links)
- On the several differences between primes (Q1429328) (← links)
- A note on factors of generalized Fermat numbers (Q1585558) (← links)
- Computational strategies for the Riemann zeta function (Q1587405) (← links)
- A constructive approach to the finite wavelet frames over prime fields (Q1787184) (← links)
- Lucas atoms (Q2006093) (← links)
- Integer factorization as subset-sum problem (Q2700674) (← links)
- Dense admissible sequences (Q2723540) (← links)
- Verifying the Goldbach conjecture up to 4⋅10¹⁴ (Q2723545) (← links)
- Half-factorial domains and quadratic orders (Q2789375) (← links)
- Estimates of $\psi ,\theta $ for large values of $x$ without the Riemann hypothesis (Q2792347) (← links)
- Large-Order Multiple Recursive Generators with Modulus 2<sup>31</sup> − 1 (Q2815474) (← links)
- A role for generalized Fermat numbers (Q2953213) (← links)
- Table errata 2 to “Factors of generalized Fermat numbers” (Q3015062) (← links)
- The impact of 𝜁(𝑠) complex zeros on 𝜋(𝑥) for 𝑥<10^{10¹³} (Q3094301) (← links)
- A babystep-giantstep method for faster deterministic integer factorization (Q3177725) (← links)
- (Q3582591) (← links)
- Factorization of the tenth Fermat number (Q4221993) (← links)
- New maximal prime gaps and first occurrences (Q4240598) (← links)
- Applying evolutionary algorithm to public key cryptosystems (Q4454496) (← links)
- New applications of the polynomial method: The cap set conjecture and beyond (Q4562036) (← links)
- Theoretical frame properties of wave-packet matrices over prime fields (Q4603784) (← links)
- (Q4618410) (← links)
- The twenty-fourth Fermat number is composite (Q4806407) (← links)
- Two algorithms to find primes in patterns (Q4960081) (← links)
- A time-space tradeoff for Lehman’s deterministic integer factorization method (Q4992239) (← links)
- SEMI TWIN PRIME NUMBERS (Q5036089) (← links)
- Interview with Bruce Sagan (Q5054904) (← links)
- A log-log speedup for exponent one-fifth deterministic integer factorisation (Q5070544) (← links)
- Generalized wavelet transforms over finite fields (Q5122482) (← links)
- Square form factorization (Q5429516) (← links)
- A Reduction of Integer Factorization to Modular Tetration (Q5859627) (← links)
- Primes of the form 2<i>p</i>+1 (Q5865688) (← links)
- New fast methods to compute the number of primes smaller than a given value (Q6038876) (← links)
- Primitive prime divisors of orders of Suzuki-Ree groups (Q6138057) (← links)
