You have understood the primitive algorithm. You're right, it's not efficient. However, it is generalized as the thesis develops and removes all impossible values in the set of test subjects (you have to read the whole paper to understand this). Still, the fully developed algorithm is not all...
Both are actually heuristic (given what is generally common to academia and what I have observed from my own research). That doesn't mean yours is heuristic -it is possible you have discovered something others have missed.
Mathematicians seek a transcendental function --call it P such that a...
Speaking as a mathematician, deterministic means not probabilistic. The solution offered is deterministic but on a heuristic time scale. To my knowledge all such deterministic algorithms are in this way lacking. There are many probabilistic seekers/tests as well. The sieve of Eratosthenes is the...
I would really like to get some constructive feed back on this prime-seeking algorithm. Computationally it's no better than the rest. However, it does offer some unique insight.
I have partitioned the set of naturals between prime and composites using a rigorous structural schema that I prove...
Indeed, also from my own experience in number theory this particular problem seems like one that demands the very information you are trying to obtain in order to solve it. In this way primes are both a fascinating enigma and a rather bothersome artifact of the set of naturals.
Hope it's not too late to offer my insight. The notion of grappling the problem of primes via composites definitely has precedent. I offer the following thesis...