Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Primality proving for 'near-powers'

  1. Sep 7, 2008 #1

    CRGreathouse

    User Avatar
    Science Advisor
    Homework Helper

    Is there a method for proving the primality of large numbers of the form
    [tex]a^b+c[/tex]
    where a and c are of similar size? I'm looking for something faster than a general primality prover like PRIMO, or a comment like "I know of no such method".
     
  2. jcsd
  3. Sep 7, 2008 #2

    Hurkyl

    User Avatar
    Staff Emeritus
    Science Advisor
    Gold Member

  4. Sep 7, 2008 #3

    CRGreathouse

    User Avatar
    Science Advisor
    Homework Helper

    I'm looking to prove primality, not factor. I'm looking for an analogue of SNFS for primality.
     
  5. Sep 7, 2008 #4

    Hurkyl

    User Avatar
    Staff Emeritus
    Science Advisor
    Gold Member

    Good point. Sorry 'bout that.
     
  6. Sep 7, 2008 #5

    CRGreathouse

    User Avatar
    Science Advisor
    Homework Helper

    :uhh: Frankly, I did *exactly* the same thing myself: I said "that's a perfect SNFS form!" and Googled to find a good client... until I realized that I was searching for the wrong thing.

    Can you verify that you know of no algorithm/program/whatever to do this quickly? That way, if I resort to some standard method like ECPP, I won't feel like I'm doing it an unreasonably hard way.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: Primality proving for 'near-powers'
  1. Ethereal primal music (Replies: 2)

Loading...