Results 41 to 50 of about 11,551,305 (305)
Prime ideal graphs of commutative rings
Indonesian Journal of Combinatorics, 2022 Let R be a finite commutative ring with identity and P be a prime ideal of R. The vertex set is R - {0} and two distinct vertices are adjacent if their product in P. This graph is called the prime ideal graph of R and denoted by ΓP.
Haval Mohammed Salih, Asaad A. Jund
doaj +1 more source
The Number of Prime Parking Functions
The Mathematical Intelligencer, 2023 A parking function of length $n$ is prime if we obtain a parking function of length $n-1$ by deleting one 1 from it. In this note we give a new direct proof that the number of prime parking functions of length $n$ is $(n-1)^{n-1}$. This proof leads to a new interpretation, in close terms to the definition of parking function.
Duarte, Rui +1 more
openaire +3 more sources
Annals of Mathematics and PhysicsThis paper introduces a novel approach to estimating the sum of prime numbers by leveraging insights from partition theory, prime number gaps, and the angles of triangles.
Budee U. Zaman
semanticscholar +1 more source
The Distribution of Prime Numbers
, 2022 In this paper, we discovered a new sequence of all prime numbers which end with a 1 or 9, the sequence defined by 𝑎(𝑛) = (𝑛^2 − 𝑛 − 1)/gcd (𝑏(𝑛), 𝑛^2 − 𝑛 − 1), with 𝑏(𝑛) satisfying the recurcive formula 𝑏(𝑛)=(𝑛 − 1). 𝑏(𝑛 − 1) − 𝑛. 𝑏(𝑛 − 2) and 𝑏(1) = 𝑏(2) = −1, the sequence 𝑎(𝑛) takes only 1’s and primes.
openaire +1 more source
On the number of prime implicants
Discrete Mathematics, 1978 AbstractIt is shown that any Boolean expression in disjunctive normal form having k conjuncts, can have at most 2k prime implicants. However, there exist such expressions that have 2k2 prime implicants. It is also shown that any Boolean expression on n distinct propositional variables can have at most O(3nn) prime implicants, and that there exist ...
Ashok K. Chandra, George Markowsky
openaire +2 more sources
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
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
The American Mathematical Monthly, 2006 a survey article; 38 pages (including appendices by Giuliana Davidoff and Michael Guy), 10 tables, 6 ...
Andrew Granville, Greg Martin
openaire +3 more sources
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