>>5536
Hello PMA! I'm thinking on this from VQC:
>All we will end up doing with the next step is figuring out a pretty pattern with odd squares with a single unit hole in the middle.
>The symmetry is beautiful in the solution.
>When that symmetry cannot exist in more than one way, you have a neat way of spotting prime numbers.
Last hint is pretty cool. Let's tie together triangle numbers and square numbers with primes. Can we create a method of generating primes within the x+n square?
We know that f is our starting point for n0. We know that u and u+1 play a role, bc VQC hinted about solving a triangle problem where one of the triangles is one unit larger. Can primes be generated as the difference between these two triangles and the mod/remainder? Thoughts, anons?