Results 21 to 30 of about 147,553 (263)
Proceedings of the American Mathematical Society, 2019 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
The occurrence of prime numbers revisited
GECONTEC: Revista Internacional de Gestión del Conocimiento y la Tecnología, 2016 Based on an arithmetical and autocatalytic approach, the authors propose a solution for the occurrence of prime numbers. Exact arithmetical calculations are provided for: the closest prime to any given positive integer (or any number of bigger or smaller
Ernesto Tapia Moore, José Tapia Yañez
doaj +4 more sources
Combinatorial Models of the Distribution of Prime Numbers
Mathematics, 2021 This work is divided into two parts. In the first one, the combinatorics of a new class of randomly generated objects, exhibiting the same properties as the distribution of prime numbers, is solved and the probability distribution of the combinatorial ...
Vito Barbarani
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
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
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
METHOD OF TESTING LARGE NUMBERS FOR PRIMALITY
Сучасні інформаційні системиThe current stage of scientific and technological development entails ensuring information security across all domains of human activity. Confidential data and wireless channels of remote control systems are particularly sensitive to various types of ...
Vladimir Pevnev +3 more
doaj +1 more source
Differentiating by Prime Numbers
Notices of the American Mathematical Society, 2023 We introduce $p$-derivations and give a few basic ways in which they act like derivatives by numbers.
openaire +2 more sources
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