checking big digit number as prime
which one is hard . calculating big digit number or checking it . which methods ca be use for checkig numbers ?
[b][color=red][size=4]MODERATOR NOTE:[/size] Thread moved from FermatSearch forum[/color][/b] 
Are you asking how hard it is to take 2[SUP]332,199,893[/SUP]1 and expand it to its full decimal form vs checking it to see if it is prime?
The first is very fast. Faster than the old machines could display it. The second is slow. If you have some complex formula to calculate the number vs checking it to see if it is prime, even that, calculating the number is faster than checking it (in almost every case). 
[QUOTE=Uncwilly;545234]Are you asking how hard it is to take 2[SUP]332,199,893[/SUP]1 and expand it to its full decimal form vs checking it to see if it is prime?
The first is very fast. Faster than the old machines could display it. The second is slow. If you have some complex formula to calculate the number vs checking it to see if it is prime, even that, calculating the number is faster than checking it (in almost every case).[/QUOTE] Just to expand on your "in almost very case". PRP'ing a huge partitions number is quicker than computing its decimal digits (with the latest Pari/GP version). Proving it prime or even checking the certificate is a few orders more timeconsuming. 
As for "which methods" from the OP question it depends on the form that describes your number, as well as how big "big digits" is.
Give us more info about what size and what form you have in mind, you'll get a better answer. 
I think I am at the begining . :) I get 2^50.000 at first night with my own code . can we think it is big :) . I am recording all results from 2 ^ 1 to 2 ^ 50000 . and it goes on I want to calculate fermat and mersenne primes

[QUOTE=drmurat;545279]I think I am at the begining . :) I get 2^50.000 at first night with my own code . can we think it is big :) . I am recording all results from 2 ^ 1 to 2 ^ 50000 . and it goes on I want to calculate fermat and mersenne primes[/QUOTE]
If you taking about how long it takes to wrtie the number to file: The following takes ~1 ms with [URL="https://pari.math.ubordeaux.fr/download.html"]Pari/GP[/URL]: [CODE]gettime();write("delMe",2^50000+1);gettime() 1 [/CODE] 
I am calculating 2^50000 and writing to file and calcupating 2^50001 and ... goes on . I get 2^60000 . big numbers get years and years ...

Apfloat also works nice: [url]http://www.apfloat.org/apfloat/[/url]
Also [url]http://numcalc.com/[/url] handles it quickly And 2^500001 is not prime. The exponent has to be prime. 
thank you . it will be so helpfull to me . I get 2 ^ 65000

[QUOTE=drmurat;545288]thank you . it will be so helpfull to me . I get 2 ^ 65000[/QUOTE]
What are your plans (please use a paragraph to state it)? If you are just practicing your coding, look at places that can help you learn. If you don't trust what everyone else has done, you have issues. Are you testing the numbers using LL? Or are you doing it via a more rudimentary way? What language/platform are you using? Why do you want the decimal expansion? 
okay . I am not plannig to improve my coding . I am behind so many thing about primes . I am medical doctor . I know a bit coding . and intrested in with primes nearly 20 mounths .I do my calculations with my own . it has to reason fitst when I need data fot one process . getting whole data is hard . you must open so many zip files . make them as you want . it gets so time . the second reason making calculation with your own gives you a chance of oservation . I am asking here to calculating 2 ^70000 is hard . I realy dont know the answer .

All times are UTC. The time now is 17:53. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2020, Jelsoft Enterprises Ltd.