A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
For x>0 let π(x) be the number of primes not exceeding x. The asymptotic behaviors of the prime-counting function π(x) and the n-th prime p_n have been studied intensively in analytic number theory. Surprisingly, we find that π(x) and p_n 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 thatarXiv:1402.6641v12 fatcat:m5o5wxr23jg5vhbwmtgt5q55vm