Page 2 of 2 First 12
  • Jump to page:
    #16
  1. No Profile Picture
    Registered User
    Devshed Newbie (0 - 499 posts)

    Join Date
    Dec 2012
    Posts
    11
    Rep Power
    0
    Originally Posted by b49P23TIvg
    In post 3 you said
    "The number of large orders. Required to perform regardless of the library program modules and their source."

    This means "determine the primality of a 40 digit number". And "the code must be in a c language (or derivative) and use no libraries other than the standard library provide with c."
    Oh, now I understand) Yes, that will do. Please help if you can :)
    The number of large orders is not a priority ... the priority of execution of the two algorithms :)
  2. #17
  3. No Profile Picture
    Registered User
    Devshed Newbie (0 - 499 posts)

    Join Date
    Dec 2012
    Posts
    11
    Rep Power
    0
    b49P23TIvg, So you can help me?
  4. #18
  5. Contributing User
    Devshed Demi-God (4500 - 4999 posts)

    Join Date
    Aug 2011
    Posts
    4,837
    Rep Power
    480
    Thanks, no.
    [code]Code tags[/code] are essential for python code and Makefiles!
  6. #19
  7. No Profile Picture
    Registered User
    Devshed Newbie (0 - 499 posts)

    Join Date
    Dec 2012
    Posts
    11
    Rep Power
    0
    Originally Posted by b49P23TIvg
    Thanks, no.
    Oh, you say that you can do it with restrictions ... sorry, I'm sorry to bother you ...
  8. #20
  9. Contributing User
    Devshed Demi-God (4500 - 4999 posts)

    Join Date
    Aug 2011
    Posts
    4,837
    Rep Power
    480
    I suggest instead you use the theorems to prove that 97 is prime and that 91 is not prime.

    I'm not expert on Riemann hypothesis.
    Nor on elliptic curve primality proofs.
    Nor do I know how to distinguish between elliptic curves that are "easy to count" versus the others.
    [code]Code tags[/code] are essential for python code and Makefiles!
Page 2 of 2 First 12
  • Jump to page:

IMN logo majestic logo threadwatch logo seochat tools logo