Related papers: Finding a Widely Digitally Delicate Prime
Two constructed prime number subsets (called prime brother & sisters and prime cousins) lead to a third one (called isolated primes) so that all three disjoint subsets together generate the prime number set. It should be suggested how the…
In this article, the exponentiated discrete Lindley distribution is presented and studied. Some important distributional properties are discussed. Using the maximum likelihood method, estimation of the model parameters is investigated.…
We present the first wavelet-based all-electron density-functional calculations to include gradient corrections and the first in a solid. Direct comparison shows this approach to be unique in providing systematic ``transparent''…
This review paper is intended to give a useful guide for those who want to apply discrete wavelets in their practice. The notion of wavelets and their use in practical computing and various applications are briefly described, but rigorous…
This article focuses on approximately prime rings and approximately prime ideals in proximal relator spaces, especially in descriptive proximity spaces. In particular, we define some binary operations, including the product of two…
The $i$-tuply $y$-densely divisible numbers were introduced by a Polymath project, as a weaker condition on the moduli than $y$-smoothness, in distribution estimates for primes in arithmetic progressions. We obtain the order of magnitude of…
We present a new sieve that allows us to find the prime numbers by using only regular patterns and, more importantly, avoiding any duplication of elements between them.
We introduce the digital projective product spaces based on Davis' projective product spaces. We determine an upper bound for the digital LS-category of the digital projective product spaces. In addition, we obtain an upper bound for the…
We investigate the common underlying discrete structures for various smooth and discrete nets. The main idea is to impose the characteristic properties of the nets not only on elementary quadrilaterals but also on larger parameter…
The second author recently suggested to identify the generating matrices of a digital $(t,m,s)$-net over the finite field $F_q$ with an $s \times m$ matrix $C$ over $F_{q^m}$. More exactly, the entries of $C$ are determined by interpreting…
The main objective of this work is twofold. On the one hand, it gives a brief overview of the area of two-party cryptographic protocols. On the other hand, it proposes new schemes and guidelines for improving the practice of robust protocol…
We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.
The following work is written in easy language for college level students. It shows how the first digit probabilities of a group of continuous real-valued functions can be calculated. Thus, examples explaining how the probabilities are…
This short paper gives an introduction to a research project to analyze how digital documents are structured and described. Using a phenomenological approach, this research will reveal common patterns that are used in data, independent from…
We present the pattern underlying some of the properties of natural numbers, using the framework of complex networks. The network used is a divisibility network in which each node has a fixed identity as one of the natural numbers and the…
We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…
We present a new random approximation method that yields the existence of a discrete Beurling prime system $\mathcal{P}=\{p_{1}, p_{2}, \dotso\}$ which is very close in a certain precise sense to a given non-decreasing, right-continuous,…
In this paper we study the integrals of fractional parts of given functions, and develop some new tools to understand the behaviour of prime differences. We demonstrate how simply some seemingly difficult conjectures related to prime…
The purpose of this article is to define and examine graded almost prime ideals over a non-commutative graded ring, and consider some cases where all graded right ideals of a non-commutative graded ring are graded almost prime.
This article presents an efficient algorithm to generate a discrete uniform distribution on a set of $p$ elements using a biased random source for $p$ prime. The algorithm generalizes Von Neumann's method and improves computational…