User blog comment:Alemagno12/Prime squares/@comment-1605058-20160331133907

If it wasn't for the fact I already knew what sieve of Eratosthenes is, I wouldn't really understand how this works. Here are a few points which make things unclear or wrong:


 * 1) You say "Construct a square such that the dimensions of the square (in Bits) are equal to x-1". This suggests that the square is actually an array of size \(x-1\times x-1\), which would have \(x^2-2x+1\) bits.
 * 2) You say we repeat this process until we get to a bit marked (x+1)/2, but this may only happen if x is odd - else no bit is marked with (x+1)/2.
 * 3) I can't make (possibly grammatical) sense out of rule 3b.
 * 4) What you mean with "get" in rule 3? Does it mean that you color bit marked with (x+1)/2? Or maybe it means that we find that bit after executing rule 3a.? Or maybe something completely else?
 * 5) Since the bits are marked only up to x, you may sometimes be forced to color a bit with undefined marking (no bit is marked with x+1), or you falsely claim that you got all primes below x+1 by markings of uncolored bits (same as above in case x+1 is prime).