Added: 7 months ago
From: orangegold1
Views: 60
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:

All Comments (5)

Sign In or Sign Up now to post a comment!
  • This does clearly work for all prime numbers, but don't assume the converse is true. If the digital sum of 6x is 6 or 3, all that means is x is not divisible by 3. Since every prime number besides 3 isn't divisible by 3, that is why this works.

  • @JamesMazur2 Yeah, I realized that pretty fast and put it in the description :P it's still fun to mess around with! Especially when you visualize it.. all the primes only fit into 2 columns in modulo 6.

  • You're fucking stupid.

  • Interesting... I was math major in college and loved Discrete Mathematics. I'm curious... do you have a proof for this? Or was it something you just discovered as a pattern of primes?

  • @Zyggurat Not a proof but rather something I just discovered... The more I think about it... this pattern might just apply to all numbers that aren't divisible by 3 & 5.. I'm not sure though, it's just fun to mess around with haha! But it does limit somewhat the numbers I do have to check when generating prime lists.

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