mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2020-05-13, 08:24   #1
drmurat
 
"murat"
May 2020
turkey

53 Posts
Default 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 ?

MODERATOR NOTE: Thread moved from FermatSearch forum

Last fiddled with by Dr Sardonicus on 2020-05-13 at 13:17 Reason: Note that thread was moved
drmurat is offline   Reply With Quote
Old 2020-05-13, 13:40   #2
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

8,627 Posts
Default

Are you asking how hard it is to take 2332,199,893-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).
Uncwilly is online now   Reply With Quote
Old 2020-05-13, 14:29   #3
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

D5516 Posts
Default

Quote:
Originally Posted by Uncwilly View Post
Are you asking how hard it is to take 2332,199,893-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).
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 time-consuming.

Last fiddled with by paulunderwood on 2020-05-13 at 14:32
paulunderwood is offline   Reply With Quote
Old 2020-05-13, 17:25   #4
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

52×173 Posts
Default

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.
VBCurtis is offline   Reply With Quote
Old 2020-05-13, 17:49   #5
drmurat
 
"murat"
May 2020
turkey

658 Posts
Default

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

Last fiddled with by drmurat on 2020-05-13 at 17:55
drmurat is offline   Reply With Quote
Old 2020-05-13, 18:03   #6
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

3,413 Posts
Default

Quote:
Originally Posted by drmurat View Post
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
If you taking about how long it takes to wrtie the number to file: The following takes ~1 ms with Pari/GP:

Code:
gettime();write("delMe",2^50000+1);gettime()
1

Last fiddled with by paulunderwood on 2020-05-13 at 18:05
paulunderwood is offline   Reply With Quote
Old 2020-05-13, 18:15   #7
drmurat
 
"murat"
May 2020
turkey

53 Posts
Default

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 ...
drmurat is offline   Reply With Quote
Old 2020-05-13, 18:20   #8
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

8,627 Posts
Default

Apfloat also works nice: http://www.apfloat.org/apfloat/
Also http://numcalc.com/ handles it quickly
And 2^50000-1 is not prime. The exponent has to be prime.

Last fiddled with by Uncwilly on 2020-05-13 at 18:21
Uncwilly is online now   Reply With Quote
Old 2020-05-13, 18:29   #9
drmurat
 
"murat"
May 2020
turkey

53 Posts
Default

thank you . it will be so helpfull to me . I get 2 ^ 65000
drmurat is offline   Reply With Quote
Old 2020-05-13, 18:36   #10
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

8,627 Posts
Default

Quote:
Originally Posted by drmurat View Post
thank you . it will be so helpfull to me . I get 2 ^ 65000
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 L-L? Or are you doing it via a more rudimentary way? What language/platform are you using? Why do you want the decimal expansion?
Uncwilly is online now   Reply With Quote
Old 2020-05-13, 18:48   #11
drmurat
 
"murat"
May 2020
turkey

53 Posts
Default

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 .
drmurat is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
checking very large number for primality. WhoCares Math 51 2017-04-20 17:17
62-digit prime factor of a Mersenne number ET_ Factoring 39 2006-05-11 18:27
checking smaller number fortega Data 2 2005-06-16 22:48
How do I prove a 4000 digit number is prime?? VJS Lounge 4 2005-05-09 20:56
The first (non-merseinne) 10 million-digit prime number!!! ron29730 Miscellaneous Math 17 2004-05-15 20:23

All times are UTC. The time now is 05:30.

Tue Sep 29 05:30:41 UTC 2020 up 19 days, 2:41, 0 users, load averages: 1.68, 1.54, 1.48

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.