Results 21 to 30 of about 1,901 (283)
A note on the primality of sums [PDF]
Surveys in Mathematics and its Applications, 2022 It is shown that when adding a large number to a set of much smaller numbers, the number of primes or twin ranks (see text) in the resulted sumset can be substantially larger than the theoretical values given by the Prime Number Theorem or Hardy ...
Antonie Dinculescu
doaj
Primes and Their Connection to Certain Polyhedral Number Sequences
Journal of Mathematics, 2021 A collection of results is given regarding whether a prime can be the sum or difference of two polyhedral numbers, as well as some primality restrictions on several sequences.
Benjamin Lee Warren
doaj +1 more source
On primality of Cartesian product of graphs [PDF]
Arab Journal of Mathematical SciencesPurposeThe present work focuses on the primality and the Cartesian product of graphs.Design/methodology/approachGiven a graph G, a subset M of V (G) is a module of G if, for a, b ∈ M and x ∈ V (G) \ M, xa ∈ E(G) if and only if xb ∈ E(G).
Nadia El Amri +2 more
doaj +1 more source
ON A NEW CLASS OF SMARANDACHE PRIME NUMBERS [PDF]
, 2005 The purpose of this note is to report on the discovery of some new prime numbers that were built from factorials, the Smarandache Consecutive Sequence, and the Smarandache Reverse ...
Earls, Jason
core +1 more source
An RSA Scheme based on Improved AKS Primality Testing Algorithm
MATEC Web of Conferences, 2016 In applied cryptography, RSA is a typical asymmetric algorithm, which is used in electronic transaction and many other security scenarios. RSA needs to generate large random primes.
Wu Han Wei +4 more
doaj +1 more source
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
Primality proving with Gauss and Jacobi sums
Journal of Telecommunications and Information Technology, 2004 This article presents a primality test known as APR (Adleman, Pomerance and Rumely) which was invented in 1980. It was later simplified and improved by Cohen and Lenstra.
Andrzej Chmielowiec
doaj +1 more source
Lower bounds on the orders of subgroups connected with Agrawal conjecture
Karpatsʹkì Matematičnì Publìkacìï, 2013 Explicit lower bounds are obtained on the multiplicative orders of subgroups of a finite field connected with primality proving algorithm.
R. Popovych
doaj +1 more source
Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317), 2001 The main result of the paper is that primality testing, gcd computation and square-free computation is not in \(AC^0\), that is, can not be accomplished by constant depth, polynomial-size circuits of AND, OR and NOT gates. The technique used by the authors is to reduce the functions that have circuit lower bound known to divisibility and then, using a ...
Eric Allender +2 more
openaire +5 more sources