Added: 4 years ago
From: spaske2528
Views: 6,052
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:

All Comments (1)

Sign In or Sign Up now to post a comment!
  • if the conjecture is true, does it say that every prime number is used, or even that everyone can bwe used just once?

  • 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.

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more