相关论文: The Set of Prime Numbers
All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…
The problem to express a natural number N as a product of natural numbers without regard to order corresponds to a thermally isolated non-interacting Bose gas in a one-dimensional potential with logarithmic energy eigenvalues. This…
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…
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…
We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$,…
In this paper, a new formula for {\pi}^(2)(N) is formulated, it is a function that counts the number of semi-primes not exceeding a given number N. A semi-prime is a natural number that is the product of precisely two prime numbers, the two…
A novel notion of unpredictable strings is revealed and utilized to define deterministic unpredictable sequences on a finite number of symbols. We prove the first law of large strings for random processes in discrete time, which confirms…
Let $\Psi$ be a system of linear forms with finite complexity. In their seminal paper, Green and Tao showed the following prime number theorem for values of the system $\Psi$: $$\sum_{x\in [-N,N]^d} \prod_{i=1}^t…
We present a new, elementary, dynamical proof of the prime number theorem.
An s-tuple of positive integers are k-wise relatively prime if any k of them are relatively prime. Exact formula is obtained for the probability that s positive integers are k-wise relatively prime.
The search for a closed-form expression of the $n$-th prime number, $p_n$, has long oscillated between the rigid determinism of analytic functions and the apparent randomness of local distributions. This paper explores three different…
By establishing an improved level of distribution we study almost primes of the form $f(p,n)$ where $f$ is an irreducible binary form over $\mathbb Z$.
A numerical study on the distributions of primes in short intervals of length $h$ over the natural numbers $N$ is presented. Based on Cram\'er's model in Number Theory, we obtain a heuristic expression applicable when $h \gg \log{N}$ but $h…
The Prime state of $n$ qubits, $|\mathbb{P}_n\rangle$, is defined as the uniform superposition of all the computational-basis states corresponding to prime numbers smaller than $2^n$. This state encodes, quantum mechanically, arithmetic…
We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.
We are interested in classifying those sets of primes $\mathcal{P}$ such that when we sieve out the integers up to $x$ by the primes in $\mathcal{P}^c$ we are left with roughly the expected number of unsieved integers. In particular, we…
A dynamic sieve method is designed according to the basic sieve method. It mainly refers to the symbolic dynamics theory. By this method, we could connect the prime system with familiar 'Logistic Mapping'. An interesting discovery is that…
When investigating the distribution of the Euler totient function, one encounters sets of primes P where if p is in P then r is in P for all r|(p-1). While it is easy to construct finite sets of such primes, the only infinite set known is…
To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…
Two closely related discrete probability distributions are introduced. In each case the support is a set of vectors in $\mathbb{R}^n$ obtained from the partitions of the fixed positive integer $n$. These distributions arise naturally when…