In this challenge we will plot a triangular Ulam spiral (as opposed to the usual, square Ulam spiral). Here's a sketch of what the spiral looks like.
As we know, the Ulam spiral arranges all natural numbers in an outward spiral, and marks only those that are prime. So in the above sketch only the numbers that appear in black (the primes) would be shown.
Accept a number N as input and display the triangular Ulam spiral up to that number.
- Input can be stdin or function argument.
- The spiral should turn in the positive direction (that is, counter-clockwise), as in the above figure.
- Any of the 120-degree turns of the above figure would be valid, and the turn may be different for different inputs. But the lowest side of the implied triangles should be horizontal, as the only allowed turns are (multiples of) 120 degrees.
- The code should run theoretically (given enough time and memory) for any N up to what is allowed by any intermediate calculations you do with your default data type.
doubleis enough; no need for large integer types.
- All built-in functions allowed.
- I won't accept my own answer (not that I think it would be the shortest anyway...).
Choose any of the following.
Display a graph with a marker (dot, circle, cross, whatever you prefer) at prime numbers, and nothing at non-prime numbers. Scale need not be the same for the two axes. That is, the implied triangles need not be equilateral. Axes, grid lines and axis labels are optional. Only the markers at the prime numbers are required.
An example output for N = 12 would be as follows (compare with the above sketch). The second plot is a more interesting example, corresponding to N = 10000.
- Produce an image file with the above, in any well known image format (such as png, tiff, bmp).
Display the spiral as ASCII art, using a single character of your choice for primes and blank space for non-primes, with a blank space to separate number positions in the same row. Leading or trailing spaces or newlines are allowed. For example, the N = 12 case using
oas character would be
o · · · o · o · · · o · o
where of course only the
omark at primes would actually be displayed. The
·at non-primes is shown here for reference only.
The actual reward is seeing for yourself those amazing patterns Code golf, shortest code wins.