Results 21 to 30 of about 315,776 (265)
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
We define S(um)anD(ifference) numbers as ordered pairs $(m,\, m+Δ)$ such that the digital-sum $DS(m(m+Δ))=Δ.$ We consider both the decimal and the binary case. If both $m$ and $m+Δ$ are prime numbers, we refer to SanD {\em primes}. We show that the number of (decimal-based) SanD numbers less than $x$ grows as $c1\cdot x,$ where $c1 = 2/3,$ while the ...
Freeman J. Dyson +2 more
openaire +4 more sources
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
Rubinstein and Sarnak have shown, conditional on the Riemann hypothesis (RH) and the linear independence hypothesis (LI) on the nonreal zeros of ζ
Lichtman, Jared Duker +2 more
openaire +2 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
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
The Number of Prime Parking Functions
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
On the number of prime implicants
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

