Results 41 to 50 of about 12,813,623 (299)
A Relation between Prime Numbers and Twin Prime Numbers [PDF]
Every mathematician has been concerned with prime numbers, and has metwith mysterious surprises about them. Besides intuition, using empirical methods has an important role to findrelations between prime numbers. A relation between any prime numberand any twin prime number has been obtained.
openaire +2 more sources
Relatively Prime Detour Domination Number of Some Switching Graphs
In this paper, we introduce the concept of relatively prime detour domination number for switching graph. If a set S ⊆ V is a detour set, a dominating set with at least two elements, and has (deg(u), deg(v)) = 1 for each pair of vertices u and v, then it
C Jayasekaran, L. G. Binoja
doaj +1 more source
Counting stabiliser codes for arbitrary dimension [PDF]
In this work, we compute the number of $[[n,k]]_d$ stabilizer codes made up of $d$-dimensional qudits, for arbitrary positive integers $d$. In a seminal work by Gross \cite{Gross2006} the number of $[[n,k]]_d$ stabilizer codes was computed for the case ...
Tanmay Singal +5 more
doaj +1 more source
Prime ideal graphs of commutative rings
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
Carmichael Numbers with a Prime Number of Prime Factors
Under the assumption of Heath-Brown's conjecture on the first prime in an arithmetic progression, we prove that there are infinitely many Carmichael numbers $n$ such that the number of prime factors of $n$ is prime.
openaire +3 more sources
Thirty-nine perfect numbers and their divisors
The following results concerning even perfect numbers and their divisors are proved: (1) A positive integer n of the form 2p−1(2p−1), where 2p−1 is prime, is a perfect number; (2) every even perfect number is a triangular number; (3) τ(n)=2p, where τ(n ...
Syed Asadulla
doaj +1 more source
This 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.
Zaman Budee U
semanticscholar +1 more source
On Triangular Secure Domination Number
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
Formulae of the Frobenius number in relatively prime three Lucas numbers [PDF]
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
Prime Number Sieving—A Systematic Review with Performance Analysis
The 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

