mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2020-05-13, 21:52   #12
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

22×1,061 Posts
Default

You keep saying "calculating 2^{some 5-digit number}". What calculation are you doing?

You don't need the decimal expansion to decide if it is prime. You also don't need to write your own software. So, what is it you want to do?

I feel like you intend to find some primes, and then write (to disk? To screen? both?) out the decimal expansions of those primes.

But you aren't even telling us what numbers you are checking. 2^50000 is obviously not prime; do you mean 2^50000 -1, or 2^50000 +1, or something else entirely?

You mentioned fermat and mersenne primes- those have been checked to quite large values, and software is easily available if you wish to contribute to those searches. Why start over from scratch, which gives you no chance whatsoever to discover something previously unknown?
VBCurtis is offline   Reply With Quote
Old 2020-05-14, 02:07   #13
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

22·3·5·31 Posts
Default

Look at the link in post number 6. It's a program that you can download for free and set up. It's a calculator which can calculate any number you give it instantly. You don't need to write your own program. There is no theoretical limit on how big a number you can give it. The only limitation is your computer's memory. Regardless you can instantly calculate numbers with millions of digit. Proving then prime can take very long time. Days, months, years....
a1call is online now   Reply With Quote
Old 2020-05-14, 06:50   #14
drmurat
 
"murat"
May 2020
turkey

32·5 Posts
Default

okay . my method to calculate exponents of 2 is similar to used methods and it is slower than them . I am calculating all because maybe I catch a relation of them so I need a library
what did I do until now .
I achive 3 method to check primes . one is for twin primes and it is well known . one is primes and sont have advantag to clasicap method . one for 6 x k - 1 primes . in this method you dont use all primes until squareroot . but it cant reduce number of calculation.
I worked on goldbach 4 ways for even numbers 2 ways to odd numbers I also calculatwd numbers until 10^7 but no one doesnt explain infinity
I found a speciality of fibonacci numbers but I think it is known
I am working two geometrical shape can be related with primes
and some more
I must look my papers
I use simple maths for calculation
thats all :)

Last fiddled with by drmurat on 2020-05-14 at 06:57
drmurat is offline   Reply With Quote
Old 2020-05-14, 08:28   #15
drmurat
 
"murat"
May 2020
turkey

32·5 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
You keep saying "calculating 2^{some 5-digit number}". What calculation are you doing?

You don't need the decimal expansion to decide if it is prime. You also don't need to write your own software. So, what is it you want to do?

I feel like you intend to find some primes, and then write (to disk? To screen? both?) out the decimal expansions of those primes.

But you aren't even telling us what numbers you are checking. 2^50000 is obviously not prime; do you mean 2^50000 -1, or 2^50000 +1, or something else entirely?

You mentioned fermat and mersenne primes- those have been checked to quite large values, and software is easily available if you wish to contribute to those searches. Why start over from scratch, which gives you no chance whatsoever to discover something previously unknown?
2^50000 only a sample
drmurat is offline   Reply With Quote
Old 2020-05-15, 18:39   #16
carpetpool
 
carpetpool's Avatar
 
"Sam"
Nov 2016

1001011002 Posts
Post

Quote:
Originally Posted by drmurat View Post
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 .
You seem to have the right idea. You want to calculate 2^n for some integer n. However, this integer n is the one you want to test for primality, and not even 2^n, but 2^n mod n. (n may have, thousands, millions, and maybe even a billion digits). Look up modular or binary exponentiation.

If a does not divide n, n is prime --> a^n = a mod n --> a^(n-1) = 1 mod n

What happens when n is composite?

Last fiddled with by carpetpool on 2020-05-15 at 18:39
carpetpool is offline   Reply With Quote
Old 2020-05-15, 18:59   #17
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

22·1,061 Posts
Default

Quote:
Originally Posted by carpetpool View Post
You seem to have the right idea. You want to calculate 2^n for some integer n. However, this integer n is the one you want to test for primality, and not even 2^n, but 2^n mod n. (n may have, thousands, millions, and maybe even a billion digits). Look up modular or binary exponentiation.
If n is the exponent, as you have clearly indicated, n *cannot* have millions or billions of digits for any meaningful description or test for primality.

The number 2^n may indeed be as large as those descriptions, but the exponent 'n' cannot. 2 raised to a thousands-of-digits number is not an item we contemplate for primality testing, ever.
VBCurtis 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 15:11.

Sat Aug 15 15:11:54 UTC 2020 up 2 days, 11:47, 0 users, load averages: 1.63, 1.84, 1.87

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.