mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 5 of 5
Search took 0.01 seconds.
Search: Posts Made By: sweety439
Forum: Wagstaff PRP Search 2019-06-26, 19:45
Replies: 28
Views: 8,619
Posted By sweety439
The common generalization is Phi(Phi(n,2),2) and...

The common generalization is Phi(Phi(n,2),2) and Phi(2*Phi(n,2),2), with any integer n

However, there are no known n such that Phi(n,2) is composite but Phi(Phi(n,2),2) is prime, also no known n...
Forum: Wagstaff PRP Search 2019-06-26, 17:41
Replies: 28
Views: 8,619
Posted By sweety439
status of the Wagstaff numbers with these...

status of the Wagstaff numbers with these exponents:


n Phi_n(2) known factors of (2^Phi_n(2)+1)/3
1 1 = unit
2 3 prime
3 7 prime
4 5 prime
5 31 ...
Forum: Wagstaff PRP Search 2019-06-26, 06:36
Replies: 28
Views: 8,619
Posted By sweety439
I saw this thread and I have a generalization for...

I saw this thread and I have a generalization for the double Mersenne numbers, Wagstaff-Mersenne numbers, Mersenne-Wagstaff numbers, double Wagstaff numbers, Mersenne-Fermat numbers and...
Forum: Wagstaff PRP Search 2019-06-25, 20:17
Replies: 28
Views: 8,619
Posted By sweety439
I know that if M(M(p)) is prime, then M(p) must...

I know that if M(M(p)) is prime, then M(p) must be itself prime, similarly, if W(W(p)) is prime, then W(p) must be itself prime.
Forum: Wagstaff PRP Search 2019-06-25, 20:13
Replies: 28
Views: 8,619
Posted By sweety439
Double Wagstaff prime?

If M(p) = 2^p-1, then M(M(p)) is called double Mersenne number, and if this number is prime, then it is called double Mersenne prime, M(M(p)) is prime for p = 2, 3, 5 and 7, but not for all...
Showing results 1 to 5 of 5

 
All times are UTC. The time now is 04:08.


Wed Oct 20 04:08:04 UTC 2021 up 88 days, 22:37, 0 users, load averages: 1.85, 2.02, 1.98

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.