Forums: » Register « |  User CP |  Games |  Calendar |  Members |  FAQs |  Sitemap |  Support |

#16
December 23rd, 2012, 05:59 PM
 ganterok
Registered User

Join Date: Dec 2012
Posts: 11
Time spent in forums: 3 h 31 m 30 sec
Reputation Power: 0
Quote:
 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."

The number of large orders is not a priority ... the priority of execution of the two algorithms

#17
December 26th, 2012, 09:43 AM
 ganterok
Registered User

Join Date: Dec 2012
Posts: 11
Time spent in forums: 3 h 31 m 30 sec
Reputation Power: 0
b49P23TIvg, So you can help me?

#18
December 26th, 2012, 10:58 AM
 b49P23TIvg
Contributing User

Join Date: Aug 2011
Posts: 3,358
Time spent in forums: 1 Month 2 Weeks 3 Days 9 h 38 m 34 sec
Reputation Power: 383
Thanks, no.
__________________
[code]Code tags[/code] are essential for python code!

#19
December 26th, 2012, 12:07 PM
 ganterok
Registered User

Join Date: Dec 2012
Posts: 11
Time spent in forums: 3 h 31 m 30 sec
Reputation Power: 0
Quote:
 Originally Posted by b49P23TIvg Thanks, no.

Oh, you say that you can do it with restrictions ... sorry, I'm sorry to bother you ...

#20
December 26th, 2012, 12:15 PM
 b49P23TIvg
Contributing User

Join Date: Aug 2011
Posts: 3,358
Time spent in forums: 1 Month 2 Weeks 3 Days 9 h 38 m 34 sec
Reputation Power: 383
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.

 Viewing: Dev Shed Forums > Programming Languages > C Programming > Goldwasser-Kilian's and Atkin-Morain's algorithms