mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > And now for something completely different

Reply
 
Thread Tools
Old 2020-06-03, 16:45   #45
sweety439
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

5×7×83 Posts
Default

Quote:
Originally Posted by carpetpool View Post
There is also this possible sequence I am approaching the T5K range for. It would be interesting to find a prime (k=6) making the "Divides Phi" achievable class (Probability 1/3). There is one here found about two decades ago.

I can attach the sieve file associated for this sequence if anyone's interested in testing further.
You can search 6*p^n+1 for all primes p, if p != 1 mod 7 and p != 34 mod 35, then there should be infinitely many primes of the form 6*p^n+1, but there is not always an easy prime, e.g. for p = 409, the first such prime is 6*409^369832+1, a 965900-digit prime!!
sweety439 is offline   Reply With Quote
Old 2020-06-03, 18:00   #46
carpetpool
 
carpetpool's Avatar
 
"Sam"
Nov 2016

22·34 Posts
Post

Quote:
Originally Posted by sweety439 View Post
You can search 6*p^n+1 for all primes p, if p != 1 mod 7 and p != 34 mod 35, then there should be infinitely many primes of the form 6*p^n+1, but there is not always an easy prime, e.g. for p = 409, the first such prime is 6*409^369832+1, a 965900-digit prime!!
p = 1 mod 4 increases the odds of such a prime, as N = 6*p^n+1 is congruent 7 mod 8, but there is still 1/3 chance --- which at 965K digits, I'm not sure if anyone would be willing to test if N | Phi(p^k,2). If more primes were found, probably then it could be worth it. I was considering working on such a project if others were interested. AFAIK, Ryan is testing 6*5^n+1 and he's had quite extensive computation power lately so maybe he'll luck out soon...

6*13^n+1 is next on the list so, I might give that sequence a quick check...
carpetpool is offline   Reply With Quote
Old 2021-06-24, 06:49   #47
sweety439
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

5·7·83 Posts
Default A new interest for "Divides Phi"

3*2^n+1 divides Phi(3*2^(n-1),2) for n = 5, 6, 8, 12, and the cofactor of them are all primes (this is the cofactor for n=12), are there any other such n?
sweety439 is offline   Reply With Quote
Old 2021-06-24, 21:48   #48
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

250516 Posts
Default

Quote:
Originally Posted by sweety439 View Post
... are there any other such n?
Is that a riddle? We give up. What is the answer?
Batalov is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Any fast paths out of Category 3 purgatory NookieN PrimeNet 9 2018-06-18 19:14
Option to prefer higher category work? Runtime Error PrimeNet 4 2018-01-07 20:20
646730219521 Divides F19 Buckle Factoring 7 2010-03-29 22:56
p^n - 1 divides p^m - 1 ==> n divides m jinydu Homework Help 10 2008-08-06 19:17

All times are UTC. The time now is 17:15.


Fri Jul 16 17:15:51 UTC 2021 up 49 days, 15:03, 1 user, load averages: 1.95, 1.86, 1.69

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.