4 comments on “A simple recurrence that produces complex behavior — and primes!

  1. what do you mean exactly by expressly engineered for this purpose?

    is there a real difference between discovery and engineering an algorithm? would you know the difference if I show you a set of engineered formula versus discovered?

    Russ

  2. Yes, you probably can’t always tell the difference. But often it’s a matter of simplicity. I think engineered objects tend to be more complex, in some sense, than objects that were found by search or just randomly written down. It’s a matter of size — the more components, the larger the space you have to search through.

    In the case of prime-generating formulas, we can tell that previous formulas were explicitly constructed to generate primes because in practice they don’t generate any primes at all. So they certainly weren’t discovered (by random search) to have this property. For example, Mills’ function (http://mathworld.wolfram.com/MillsTheorem.html), as far as we can tell, requires you to explicitly put in any primes you will ever get out.

  3. Pingback: Uma nova relação de recorrência geradora de números primos e 1’s demonstrada por Eric Rowland « problemas | teoremas

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s