Results 1 to 11 of 11

Thread: Colbert Numbers

  1. #1

    Talking Colbert Numbers

    Science has decided!

    See our homepage for details about the newest inspiration for running SB: finding the remaining Colbert Numbers!

    http://www.seventeenorbust.com/


    Cheers,
    Louie

  2. #2
    I think there's an error in the content accessed by one of the links you posted in the news post. On http://primes.utm.edu/glossary/xpage/ColbertNumber.html it says:
    "Waclaw Sierpinski used modular covers to prove there were infinitely many odd integers k for which k*2^n+1 are prime for all n > 1. It has been conjectured that 78557 is the smallest . . ."

    Shouldn't it say that there are infinitely many odd integers k for which k*2^n+1 are COMPOSITE for all n > 1?

  3. #3
    Quote Originally Posted by wolfemancs View Post
    I think there's an error in the content accessed by one of the links you posted in the news post. On http://primes.utm.edu/glossary/xpage/ColbertNumber.html it says:
    "Waclaw Sierpinski used modular covers to prove there were infinitely many odd integers k for which k*2^n+1 are prime for all n > 1. It has been conjectured that 78557 is the smallest . . ."

    Shouldn't it say that there are infinitely many odd integers k for which k*2^n+1 are COMPOSITE for all n > 1?
    The reference is surprisingly correct. That's one of the most interesting thing, that there should be so many Sierpinski Numbers.... infinite even. SB is just proving conclusively which is the smallest. By finding the required Colbert Numbers.

    Cheers,
    Louie

  4. #4
    Hmmm. . . by looking for the Colbert numbers, aren't we looking for prime numbers? With the reasoning that finding a single prime for each of the remaining k values, we prove that k*2^n+1 is Not COMPOSITE for all n, thereby proving that 78,557 is the lowest k for which k*2^n+1 is COMPOSITE for all n?

  5. #5
    Quote Originally Posted by wolfemancs View Post
    Hmmm. . . by looking for the Colbert numbers, aren't we looking for prime numbers? With the reasoning that finding a single prime for each of the remaining k values, we prove that k*2^n+1 is Not COMPOSITE for all n, thereby proving that 78,557 is the lowest k for which k*2^n+1 is COMPOSITE for all n?
    Haha... I'm dumb.

    My mind wouldn't allow me to believe that anything Chris Caldwell wrote and/or read could possibly be wrong so I totally missed your point. Sorry. I'm pretty sure you're right now after re-reading it again.

    Obviously there aren't any known k values for which ALL n > 1 are prime, or you could generate arbitrarily large prime numbers by just plugging large n values in. EFF prizes here we come! ... so yeah, you've convinced me now. Thanks for not giving up on me.

    Let me contact Chris and get that updated. Thanks!

    Cheers,
    Louie

  6. #6
    Want more number crunchers? Marketing, marketing, marketing! I love it.

    So who gets credit for the idea?

  7. #7
    Quote Originally Posted by Deciheximal View Post
    So who gets credit for the idea?
    My girlfriend. A lot of mathematicians agree that it's a good name too though. So we've gone ahead and set up the new definition.

    Hopefully the Colbert nation will get wind of it. We can't wait to uncover the next Colbert Number so that we may honor Stephen Colbert!

    Cheers,
    Louie

  8. #8
    A friend of mine asked an interesting question about the definition of Colbert numbers.

    Were a second prime to be found for any of the already completed k values, or 2 primes found for the k values currently being tested, would only the first found classify as a Colbert Number (because it's the only one that helps prove the theorem), would both numbers be Colbert numbers (because either of them could be used in the proof of the theorem)?

  9. #9
    Quote Originally Posted by wolfemancs View Post
    A friend of mine asked an interesting question about the definition of Colbert numbers.

    Were a second prime to be found for any of the already completed k values, or 2 primes found for the k values currently being tested, would only the first found classify as a Colbert Number (because it's the only one that helps prove the theorem), would both numbers be Colbert numbers (because either of them could be used in the proof of the theorem)?
    Only the first number would be required so only it would be a Colbert Number. Otherwise there would be an infinite amount of them. There is particular significance that there are only 11.


    Cheers,
    Louie

  10. #10
    Quote Originally Posted by jjjjL View Post
    Hopefully the Colbert nation will get wind of it. We can't wait to uncover the next Colbert Number so that we may honor Stephen Colbert!
    What if the person finding the number doesn't like Colbert???

  11. #11
    Quote Originally Posted by Drakull View Post
    What if the person finding the number doesn't like Colbert???
    Or is from a country that is not USA?
    I've never heard about the person before, but that does not prevent me from wanting to find primes!

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •