24339polynomial complexity conjecture
- Aug 1, 2012Conjecture:
This polynomial expression is always zero for all triplets of consecutive prime numbers greater than 23.
Product[k Prime[n+1]+(m-k)*Prime[n-1]-m Prime[n],
It isinteresting to note that the order of complexity of this expression is less than
log[n] ^ 4 and hence is a expression with polynomial complexity.
Sebastian Martin Ruiz
[Non-text portions of this message have been removed]
- Next post in topic >>