PROBLEMS ON COMBINATORIAL PROPERTIES OF PRIMES

From MaRDI portal




Abstract: For xge0 let pi(x) be the number of primes not exceeding x. The asymptotic behaviors of the prime-counting function pi(x) and the n-th prime pn have been studied intensively in analytic number theory. Surprisingly, we find that pi(x) and pn have many combinatorial properties which should not be ignored. In this paper we pose 60 open problems on combinatorial properties of primes (including connections between primes and partition functions) for further research. For example, we conjecture that for any integer n>1 one of the n numbers pi(n),pi(2n),...,pi(n2) is prime; we also conjecture that for any integer n>6 there exists a prime p<n such that pn is a primitive root modulo pn. One of our conjectures involving the partition function p(n) states that for any prime p there is a primitive root g<p modulo p with ginp(n):n=1,2,3,....











This page was built for publication: PROBLEMS ON COMBINATORIAL PROPERTIES OF PRIMES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3461839)