This Applet will calculate prime pairs lists. These lists are a rearrangement of all the integers between 1 and some target number N such that each adjacent pair of integers in the list will add up to a prime number. The list must start with 1 and end with N.
This Applet shows all the combinations it tries as it builds up the list. To keep things interesting, it goes really slow for N less than or equal to 10, moderately slow up to 25, moderately fast up to 40, and runs all out up to 50.
This Applet was written by Adam and Tim Lipetz and is Copyright 2000.
If you would like to see the Java source code, click here.