Prime-Generating Recurrence

This Demonstration explores solutions of the recurrence through the difference sequence , which exhibits complex behavior. For the initial condition , the sequence consists entirely of s and primes, making this recurrence a rare "naturally occurring" generator of primes.
This result is not true in general: for example, letting produces , and letting produces . However, for these initial conditions, the difference sequence eventually consists entirely of s and primes. It is an unsolved problem to determine whether all initial conditions eventually produce only s and primes.
You can choose to view all terms of the difference sequence or only the terms which are not .

This recurrence was discovered at the 2003 NKS Summer School by a group led by Matt Frank.
This Demonstration allows initial conditions . For , is for .
For more information, see E. S. Rowland, "A Natural Prime-Generating Recurrence," Journal of Integer Sequences [online], 11(2), 2008.
comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+