mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 7 of 7
Search took 0.01 seconds.
Search: Posts Made By: K Ramsey
Forum: Miscellaneous Math 2006-05-28, 13:04
Replies: 6
Views: 1,804
Posted By K Ramsey
Where do I get this program and is the code...

Where do I get this program and is the code available so that I can study it?

Also since my test gives correct results for the first 162 primes excluding p=2 since 3 is a special case. Is it...
Forum: Miscellaneous Math 2006-05-28, 11:16
Replies: 6
Views: 1,804
Posted By K Ramsey
I fed this program 2^4423 -1 and it took only...

I fed this program 2^4423 -1 and it took only about 5 seconds to print out all 1602 digits and that the number is prime! Is this really a good base mark to judge my program on?
I did improve the...
Forum: Miscellaneous Math 2006-05-27, 16:52
Replies: 6
Views: 1,804
Posted By K Ramsey
Re New test for Mersenne Primes

I wrote a basic program that tests for Mersenne primes based on my thread "Is This of any Merit" but havn't done the task of enhancing the speed of the program yet. This program weeded out all...
Forum: Miscellaneous Math 2006-05-20, 11:30
Replies: 6
Views: 1,337
Posted By K Ramsey
I have downloaded Pari but am new to it. Anyone...

I have downloaded Pari but am new to it. Anyone care to write a Pari version of my test so I can work with larger numbers? I am using windows XP

PS the sequence S_0 = 0, S__1= 1 S_n =...
Forum: Miscellaneous Math 2006-05-19, 02:23
Replies: 6
Views: 1,337
Posted By K Ramsey
Thanks After considering your comment, I...

Thanks
After considering your comment, I realized that it is not necessary to store more than one term and that my test can be refined so that there are only p-1 terms that need to be calculated....
Forum: Miscellaneous Math 2006-05-18, 01:25
Replies: 6
Views: 1,337
Posted By K Ramsey
I mean by non trivial, for example that S_n is...

I mean by non trivial, for example that S_n is always prime to S_(n+1), and particularly that at most only one of S_n and S_(n+1) are divisible by the Mersenne prime M(p)
Forum: Miscellaneous Math 2006-05-17, 22:00
Replies: 6
Views: 1,337
Posted By K Ramsey
Is this of any merit?

I think the following test for Mersenne Primes works but I dont have the ability to check it. My Excel macro works but it is limited to small numbers.
I only tested it for 2<p<27 but it gives...
Showing results 1 to 7 of 7

 
All times are UTC. The time now is 02:35.


Fri Oct 22 02:35:55 UTC 2021 up 90 days, 21:04, 1 user, load averages: 2.55, 2.28, 2.12

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.