Results 41 to 50 of about 11,676,412 (344)
Prime number races for elliptic curves over function fields [PDF]
, 2015 We study the prime number race for elliptic curves over the function field of a proper, smooth and geometrically connected curve over a finite field. This constitutes a function field analogue of prior work by Mazur, Sarnak and the second author. In this
Byungchul Cha, Daniel Fiorilli, F. Jouve
semanticscholar +1 more source
Orderings of weakly correlated random variables, and prime number races with many contestants [PDF]
, 2015 We investigate the race between prime numbers in many residue classes modulo q, assuming the standard conjectures GRH and LI. Among our results we exhibit, for the first time, n-way prime number races modulo q where the biases do not dissolve when $$n, q\
Adam J. Harper, Youness Lamzouri
semanticscholar +1 more source
On Triangular Secure Domination Number
InPrime, 2020 Let T_m=(V(T_m), E(T_m)) be a triangular grid graph of m ϵ N level. The order of graph T_m is called a triangular number. A subset T of V(T_m) is a dominating set of T_m if for all u_V(T_m)\T, there exists vϵT such that uv ϵ E(T_m), that is, N[T]=V(T_m).
Emily L Casinillo +3 more
doaj +1 more source
Prime Number Sieving—A Systematic Review with Performance Analysis
AlgorithmsThe systematic generation of prime numbers has been almost ignored since the 1990s, when most of the IT research resources related to prime numbers migrated to studies on the use of very large primes for cryptography, and little effort was made to ...
Mircea Ghidarcea, Decebal Popescu
doaj +1 more source
Formulae of the Frobenius number in relatively prime three Lucas numbers [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2020 In this paper, we find the explicit formulae of the Frobenius number for numerical semigroups generated by relatively prime three Lucas numbers 2 , L L i i and Lil for given integers i ≥ 3, l ≥ 4 .
Ratchanok Bokaew +2 more
doaj +1 more source
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer [PDF]
SIAM Review, 1995 A digital computer is generally believed to be an efficient universal computing device; that is, it is believed to be able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true
P. Shor
semanticscholar +1 more source
Close to Uniform Prime Number Generation With Fewer Random Bits [PDF]
IEEE Transactions on Information Theory, 2014 In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime $p$ less than $x$ , the basic idea is to fix a constant $q\propto x^{1- \varepsilon }$ , pick a uniformly random ...
Pierre-Alain Fouque, Mehdi Tibouchi
semanticscholar +1 more source
Results on Relatively Prime Domination Number of Vertex Switching of Some Graphs
Ratio Mathematica, 2023 If a set S ⊆ V has at least two members and every pair of vertices u and v is such that (d(u), d(v)) = 1, then it is said to be a relatively prime dominating set.
A Jancy Vini, C Jayasekaran
doaj +1 more source
Natural Number series from Prime Number [PDF]
, 2013 Volume 1 Issue 9 (November ...
Paul, S. (Shubhankar)
core
Dynamical Sieve of Eratosthenes
, 2011 In this document, prime numbers are related as functions over time, mimicking the Sieve of Eratosthenes. For this purpose, the mathematical representation is a uni-dimentional time line depicting the number line for positive natural numbers N, where each
Mateos, Luis A.
core +2 more sources