This video shows the sets of bitstrings which when reversed and AND'ed with themselves lead to a result>0 for bitstrings with length N as N increases. If the Goldbach conjecture is correct, then the set of primes represented as a bit-string must be one of the colored pixels in the animation, but the animation does not make any other claims.
if the conjecture is true, does it say that every prime number is used, or even that everyone can bwe used just once?
Werelion2367 4 years ago
This video shows the sets of bitstrings which when reversed and AND'ed with themselves lead to a result>0 for bitstrings with length N as N increases. If the Goldbach conjecture is correct, then the set of primes represented as a bit-string must be one of the colored pixels in the animation, but the animation does not make any other claims.
spaske2528 4 years ago