User blog:Alemagno12/Prime squares

I came up with a kinda creative way to generate primes: Prime squares.

Definition
We have an unit, the Bit. This bit is represented as a square, and can be in 2 states: coloured and non-coloured.

To calculate the primes up to a number x, do the following:

1. Construct a square with Bits such that the dimensions of the square (in Bits) are equal to x-1.

2. Mark each Bit, starting at the first row and the first column and advancing to the last column, then going to the next row and repeating the process until we get to the last bit, with the nonnegative integers from 2 to x.

WIP