This section just answers some questions you may have. Go to the Interface section if you have questions that are more about how the controls and interface work exactly. Even deeper questions can be answered by thoroughly looking at the code.
Q: What is this, and what does it do?
A: This is the Prime map generator (

[there should be a version number here]). It's made to draw 'maps' in different shapes and sizes of prime numbers. It uses given values to create a huge table of all selected prime numbers, and gives prime numbers and composites colours. The result is some sort of 'map' that displays where these prime numbers are located relative to each other.

Q: What algorithm is used to find these primes?
A: The Sieve of Atkin. I actually accidentally reinvented it when I tried to optimalise the old sieve of Erathosthenes.

Q: Sieve of Atkin? There's far quicker methods than that!
A: Not really a question, but OK. I know there's faster methods than the sieve of Atkin, but that's not the aim of this generator. This is just a simple generator that shows a few nice map. Not only that, but a simple webpage with Javascript can't even reach the numbers where those faster methods have a significant faster calculating time. And lastly, those faster methods are not 100% reliable. Sure, 99%, but 99% < 100%.

Q: What are prime k-tuples?
A: A prime k-tuple is a set of values representing a repeatable pattern of differences between primes. For example, a twin prime is a set of primes where the difference is exactly two. You may also enter your own constellation.

Q: What are defined as primes and what as composites?
A: 0 and 1 are neither. Every integer that has only itself as a prime factor is a prime. The rest is a composite.

Q: I'm using Firefox and--
A: Did you not read the message that popped up when you visited this website with Firefox? Firefox' JS engine is horrible and slow. Firefox-only bugs will not be fixed. I fixed one Firefox bug once, but that was before I found out about how horrible SpiderMonkey is. Try going to the Browser comparison section of the help menu to see what I mean.

Q: Is there a browser that I should use for this?
A: Of course, the choice is up to you. However, I'd really recommend using Google Chrome or Opera, though Chrome is just slightly better. They both use the V8 JE engine. After that come Internet Explorer and Safari, but while those two would be number three and four, there is still a huge performance gap between them and the numbers one and two. Number five is Firefox. I haven't really took the time to test other browsers.

Q: How accurate are the timers?/Why does it give either 16ms or 0ms, not in between?
A: The timer is started right after having initialised everything, and it's the first thing that is stopped once the calculations are done. The timer should be accurate up to about 16ms, depending on your browser. Your browser executes loops at a maximum speed of about 16ms each cycle, some browsers quicker than others.

Q: Is there a changelog?
A: While the changelog can be accessed by clicking "Changelog" directly underneath the big "Help" above here, you may also access it directly

here.

Q: What are my legal limitations?
A: The legal stuff can be found in the heading section of

the code.