Results 1 to 10 of about 137 (116)
Primality testing and factoring [PDF]
Theoretical Computer Science, 1983 AbstractWe show that any efficient deterministic algorithm for finding square roots modulo a prime can be turned into an efficient Monte Carlo primality test which has a very small error probability if factoring is hard.We apply our general construction to a well-known square root algorithm and give explicit bounds for the error probability of the ...
James Finn, Karl J. Lieberherr
+26 more sources
A Simple Algorithm for Prime Factorization and Primality Testing
Journal of Mathematics, 2022 We propose a new simple and faster algorithm to factor numbers based on the nature of the prime numbers contained in such composite numbers. It is well known that every composite number has a unique representation as a product of prime numbers.
Kabenge Hamiss
doaj +2 more sources
Asymptotic ω-Primality of Finitely Generated Cancelative Commutative Monoids
Mathematics, 2023 The computation of ω-primality has been object of study, mainly, for numerical semigroups due to its multiple applications to the Factorization Theory. However, its asymptotic version is less well known.
Juan Ignacio García-García +2 more
doaj +1 more source
Influence of Production Factors on Beef Primal Tissue Composition [PDF]
Foods, 2022 This study used 1076 crossbred steers to evaluate the effects of calf-fed and yearling-fed beef production systems, implant strategies (with and without implants), and their interactions on the primal tissue composition (lean and fat components) of individual primal cuts using complete carcass dissection data.
Vipasha Sood +9 more
openaire +3 more sources
On the primality of totally ordered q-factorization graphs
Canadian Journal of Mathematics, 2023 AbstractWe introduce the combinatorial notion of a q-factorization graph intended as a tool to study and express results related to the classification of prime simple modules for quantum affine algebras. These are directed graphs equipped with three decorations: a coloring and a weight map on vertices, and an exponent map on arrows (the exponent map ...
Adriano Moura, Clayton Silva
openaire +3 more sources
Polynomial Factorization and Primality Criterion for Fermat Numbers
INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH, 2022 Abstract Let p be a prime integer and let k ∈N. We purpose a factorization of X2k +1 (mod p) allowing ti give a primality criterion for Fermat numbers.
FALL, Oumar, Chérif Bachir DEME
openaire +3 more sources
Characterization of prime and composite numbers using the notion of successive sum of integers and the consequence in primality testing [PDF]
Notes on Number Theory and Discrete MathematicsIn this paper, we give a characterization of primes and composite natural numbers using the notion of the sum of successive natural numbers. We prove essentially that an odd natural number N≥3 is prime if and only if the unique decomposition of N as a ...
Fateh Mustapha Dehmeche +2 more
doaj +1 more source
International Journal of Mathematics and Mathematical Sciences, 2015 Elliptic curves have a wide variety of applications in computational number theory such as elliptic curve cryptography, pairing based cryptography, primality tests, and integer factorization.
Keisuke Hakuta
doaj +1 more source