C Programming
 
Forums: » Register « |  User CP |  Games |  Calendar |  Members |  FAQs |  Sitemap |  Support | 
User Name:
Password:
Remember me

The Shed is going Social! Join us on FaceBook and Twitter and chime in on the conversation.

Go Back   Dev Shed Forums > Programming Languages > C Programming
Reload this Page

Page 2 - Goldwasser-Kilian's and Atkin-Morain's algorithms


Reply
Add This Thread To:
  Del.icio.us   Digg   Google   Spurl   Blink   Furl   Simpy   Y! MyWeb 
Page 2 of 2 < 1 2
« Previous Thread | Next Thread »  
Thread Tools Search this Thread Rate Thread Display Modes
 
Unread Dev Shed Forums Sponsor:
  #16  
Old December 23rd, 2012, 05:59 PM
ganterok ganterok is offline
Registered User
Dev Shed Newbie (0 - 499 posts)
  
Join Date: Dec 2012
Posts: 11 ganterok User rank is Just a Lowly Private (1 - 20 Reputation Level) 
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."

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
Reply With Quote
  #17  
Old December 26th, 2012, 09:43 AM
ganterok ganterok is offline
Registered User
Dev Shed Newbie (0 - 499 posts)
  
Join Date: Dec 2012
Posts: 11 ganterok User rank is Just a Lowly Private (1 - 20 Reputation Level) 
Time spent in forums: 3 h 31 m 30 sec
Reputation Power: 0
b49P23TIvg, So you can help me?
Reply With Quote
  #18  
Old December 26th, 2012, 10:58 AM
b49P23TIvg's Avatar
b49P23TIvg b49P23TIvg is online now
Contributing User
Dev Shed Loyal (3000 - 3499 posts)
  
Join Date: Aug 2011
Posts: 3,358 b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level) 
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!
Reply With Quote
  #19  
Old December 26th, 2012, 12:07 PM
ganterok ganterok is offline
Registered User
Dev Shed Newbie (0 - 499 posts)
  
Join Date: Dec 2012
Posts: 11 ganterok User rank is Just a Lowly Private (1 - 20 Reputation Level) 
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 ...
Reply With Quote
  #20  
Old December 26th, 2012, 12:15 PM
b49P23TIvg's Avatar
b49P23TIvg b49P23TIvg is online now
Contributing User
Dev Shed Loyal (3000 - 3499 posts)
  
Join Date: Aug 2011
Posts: 3,358 b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level)b49P23TIvg User rank is Major (30000 - 40000 Reputation Level) 
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.
Reply With Quote
Reply
Page 2 of 2 < 1 2

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

« Previous Thread | Next Thread »

Developer Shed Advertisers and Affiliates



Thread Tools  Search this Thread 
Search this Thread:

Advanced Search
Display Modes  Rate This Thread 
Linear Mode Linear Mode
Rate This Thread:


Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts
vB code is On
Smilies are On
[IMG] code is On
HTML code is Off
View Your Warnings | New Posts | Latest News | Latest Threads | Shoutbox
Forum Jump

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


Powered by: vBulletin Version 3.0.5
Copyright ©2000 - 2013, Jelsoft Enterprises Ltd.

© 2003-2013 by Developer Shed. All rights reserved. DS Cluster - Follow our Sitemap