mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 32
Search took 0.02 seconds.
Search: Posts Made By: 1260
Forum: Miscellaneous Math 2005-03-11, 06:28
Replies: 46
Views: 2,795
Posted By 1260
Thanks everyone for enlightening me on this,...

Thanks everyone for enlightening me on this, especially Uncwilly for the graphs. You know, a picture speaks a thousand words.

Regarding the derivative not being applicable to integers, I...
Forum: Miscellaneous Math 2005-03-09, 15:03
Replies: 46
Views: 2,795
Posted By 1260
Can someone please explain to me why you can't...

Can someone please explain to me why you can't get the derivative of a function that is defined only on the integers?
Forum: Miscellaneous Math 2005-03-09, 14:53
Replies: 46
Views: 2,795
Posted By 1260
It's okay. I've received stronger words than...

It's okay. I've received stronger words than those. I guess that's part of learning. Don't be afraid to be called a troll (especially if you're one :grin: ).

Yes, that's what I was after-- the...
Forum: Miscellaneous Math 2005-03-09, 14:47
Replies: 46
Views: 2,795
Posted By 1260
Well, I guess I was not clear enough about the...

Well, I guess I was not clear enough about the value of F. I was actually referring to a value at the top of one of the curves as illustrated by Uncwilly. If it were located there, b would decrease....
Forum: Miscellaneous Math 2005-03-08, 14:14
Replies: 46
Views: 2,795
Posted By 1260
Is this a feasible factoring method?

Let N be a number that is proven to be composite but whose factors are unknown. Let F be a number less than the square root of N.

Then N = b mod F.

Increase F by 1, and b decreases by a...
Forum: Math 2004-07-07, 07:07
Replies: 2
Views: 714
Posted By 1260
try this page:...

try this page: http://www.primepuzzles.net/conjectures/conj_031.htm
Forum: Math 2004-04-22, 05:08
Replies: 7
Views: 5,033
Posted By 1260
Question What qualifies for record-prime status?

What qualifies for record-prime status? What is meant by an explicit prime?

[a] If M(n) is the n-th Mersenne prime, and n*2^k*M(n)-1 is a 10-million digit prime for some positive integers n and k,...
Forum: Math 2003-12-16, 11:34
Replies: 12
Views: 1,156
Posted By 1260
Re: Re: Re: is 2M^2-1 prime?

What software did you use?




Isn't the Brillhart-Lehmer-Selfridge test sufficient to prove that p=2*M^2-1 is composite or prime (since the factors of p+1 are 2 and M)?
Forum: Math 2003-12-15, 08:49
Replies: 12
Views: 1,156
Posted By 1260
Re: Re: is 2M^2-1 prime?

Joe's Number theory web (http://www.spacefire.com/numbertheory/default.asp?SubPage=ZMath.htm) states that the Zmath Excel provides arbitrary precision arithmetic on integers upto 250 digits....
Forum: Math 2003-12-15, 03:22
Replies: 12
Views: 1,156
Posted By 1260
is 2M^2-1 prime?

I checked 31 of the 40 mersenne primes and found that 2*M^2-1 is prime only for 5 cases: M1 (n=2), M2 (n=3), M4 (n=7), M6 (n=17), and M7 (n=19).

2*(2^2-1)^2-1 is prime
2*(2^3-1)^2-1 is prime...
Forum: Lounge 2003-12-09, 08:08
Replies: 15
Views: 1,446
Posted By 1260
Check the Status page. Notice that the range...

Check the Status page. Notice that the range where M40 was found has a 0.53 probability of finding a prime. The range from 40250000 to 50000000 has a 0.56 probability which means M41 most likely...
Forum: Lounge 2003-12-09, 07:50
Replies: 9
Views: 1,258
Posted By 1260
Wink Who'll discover M41?

What's the probability that the discoverers of M39 and M40 all have 'Michael' for their first names?

Could we safely say that another 'Michael' will discover M41?
Forum: Math 2003-10-12, 09:48
Replies: 13
Views: 3,135
Posted By 1260
the eval() might work for small numbers, like...

the eval() might work for small numbers,
like less than a hundred digits,
but it wont do for a thousand digits.
I guess, only WinPFGW will work here.

Actually, all primes greater than three ...
Forum: Math 2003-08-10, 11:46
Replies: 13
Views: 3,135
Posted By 1260
Yes you're right. Thanks. I guess, this...

Yes you're right. Thanks.

I guess, this search for B is time consuming, as I estimate B to have about 5000 digits, and there isnt a sieving program that allows expressions. :(
Forum: Puzzles 2003-07-13, 08:15
Replies: 59
Views: 3,095
Posted By 1260
Is the next number 276?

Is the next number 276?
Forum: Math 2003-06-10, 04:23
Replies: 13
Views: 3,135
Posted By 1260
I tested B for values from -1999 to 2000 and...

I tested B for values from -1999 to 2000 and didn't find any twin primes. I guess, its larger than 2000 or smaller than -1999.

By the way, B is always of the form 3n - 1 where n is any integer.
Forum: Miscellaneous Math 2003-05-29, 07:47
Replies: 23
Views: 2,050
Posted By 1260
Okay. If it is really THAT LARGE, isn't there a...

Okay. If it is really THAT LARGE, isn't there a mathematical conversion to do something similar?

I mean, if S(n-1) = A mod M(n) = B mod M(n+k), then computation can start from S(n-1) to S(n-1+k)...
Forum: Miscellaneous Math 2003-05-28, 06:13
Replies: 23
Views: 2,050
Posted By 1260
Faster way to do LLT?

As I understand it, everytime the LLT is done to M(n), computation starts from S(1) mod M(n) up to S(n-1) mod M(n).

Suppose, if the unMODed value of S(n-1) is saved so that it can be used for the...
Forum: 3*2^n-1 Search 2003-05-02, 07:49
Replies: 8
Views: 1,833
Posted By 1260
Yes, I was. By the way, does k have to be prime...

Yes, I was. By the way, does k have to be prime in order for 3k*2^n-1 to be prime? Is this also true with 15k*2^n-1?
Forum: 3*2^n-1 Search 2003-05-01, 13:30
Replies: 8
Views: 1,833
Posted By 1260
The lesser of any twin prime pair can always be...

The lesser of any twin prime pair can always be expressed in the form: 3k*2^n-1. The greater of the pair would be 3k*2^n+1.

Have you checked to see if any of them were part of a twin prime pair?
Forum: PSearch 2003-05-01, 13:16
Replies: 6
Views: 3,256
Posted By 1260
Yes. I've now switched to WinPFGW. It's really...

Yes. I've now switched to WinPFGW. It's really faster. Thanks.
Forum: Software 2003-05-01, 06:37
Replies: 17
Views: 2,453
Posted By 1260
Yes, I'm now using WinPFGW, and it has the option...

Yes, I'm now using WinPFGW, and it has the option to evaluate an expression for primality, aside from those of special forms. It's not that limited after all.[/i]
Forum: PSearch 2003-04-28, 10:17
Replies: 6
Views: 3,256
Posted By 1260
Thanks William. I'm now using version 0.4 update...

Thanks William. I'm now using version 0.4 update 4 of PrimeForm because it has an option to check an expression. Primo can only test up to 2^40960 and the numbers I am testing are over 2^300000.
Forum: Software 2003-04-24, 10:37
Replies: 17
Views: 2,453
Posted By 1260
Thanks.

Thanks.
Forum: PSearch 2003-04-23, 13:59
Replies: 6
Views: 3,256
Posted By 1260
Another question: When will the option for...

Another question: When will the option for primality testing of expressions be implemented?

--Ray
Showing results 1 to 25 of 32

 
All times are UTC. The time now is 21:40.

Sat Jul 4 21:40:37 UTC 2020 up 101 days, 19:13, 1 user, load averages: 1.57, 1.23, 1.23

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.