The paper constructs, in principle, fixed-length arithmetic terms for the prime-counting function pi(n) and the n-th prime p(n), with p(n) expressed as a hypercube-derived count of solutions to a 42-variable exponential Diophantine equation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.NT 1years
2024 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On arithmetic terms expressing the prime-counting function and the n-th prime
The paper constructs, in principle, fixed-length arithmetic terms for the prime-counting function pi(n) and the n-th prime p(n), with p(n) expressed as a hypercube-derived count of solutions to a 42-variable exponential Diophantine equation.