Results 1 to 2 of 2

Math Help - programming for pseudoprime problem

  1. #1
    Senior Member
    Joined
    Feb 2008
    Posts
    321

    programming for pseudoprime problem



    i cant see any connection between hint and the question
    Attached Thumbnails Attached Thumbnails programming for pseudoprime problem-1.jpg  
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Grand Panjandrum
    Joined
    Nov 2005
    From
    someplace
    Posts
    14,972
    Thanks
    4
    Quote Originally Posted by szpengchao View Post


    i cant see any connection between hint and the question
    You have not got all of the hint. It is warning you that 13^{10^6} will be out of range for the integer type in the programming language you choose, for the range of witness and candidate primes that your algorithm is required to operate over (and I suspect it is also suggesting that you decompose your exponents into binary and compute the powers incrementally modulo p)

    CB
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. 2-pseudoprime!
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: November 20th 2011, 05:32 AM
  2. Proving a Pseudoprime?
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: May 30th 2010, 01:52 AM
  3. Strong pseudoprime
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: May 10th 2010, 10:24 AM
  4. Fermat Pseudoprime problem
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: December 31st 2009, 02:52 AM
  5. Fermat pseudoprime
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: May 2nd 2008, 09:15 PM

Search Tags


/mathhelpforum @mathhelpforum