Interesting... although I'm trying to create mine so that the calculations do not move up exponentially each recursion... any hint as to where to find the algorithm? (Which journal, etc...)
Interesting... although I'm trying to create mine so that the calculations do not move up exponentially each recursion... any hint as to where to find the algorithm? (Which journal, etc...)
An arxiv search did not find the original article, but the new & improved version. Look at http://arxiv.org/math/papers/0406/0406001.pdf .This is a paper by a chap named Sebastian Martin Ruiz, and very representative of the type of paper I was remembering. I also checked the guy's reference list. Do you really want to know about Smarandache functions or fuzzy logic as applied to semigroups? I didn't. Best of luck--Steve
Doh! The fractal pattern is self referential! I have found that any pattern I have looked using the function still requires a collection of iterations to find primes, just like looking for primes the ordinary way--but on a higher level. *Brain ache*Originally posted by vertion@Oct 20 2004, 01:35 AM
I would like to report that in addition to a linear pattern, I have found a fractal (subdivisional) pattern in the nature of prime numbers.