![]() |
|
|
#23 |
|
Jan 2005
1DF16 Posts |
In range 500-510, only one non-prime prp occured:
504725030*3^3-1 is prp It factors as: 87011 * 156619 The next prime for the k is: 504725030*3^11-1 |
|
|
|
|
|
#24 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5,881 Posts |
should we be stopping using base 3 prp tests for base 3 conjectures
would that help the number of prps we are getting |
|
|
|
|
|
#25 |
|
Jan 2005
7378 Posts |
I reckon it would reduce it a bit, but still, they will be there, and final tests will be needed, so no gain will be made overall.
|
|
|
|
|
|
#26 |
|
May 2007
Kansas; USA
101·103 Posts |
|
|
|
|
|
|
#27 |
|
May 2007
Kansas; USA
1040310 Posts |
Here's a question for the PRP/PSP gurus:
Is it possible to have a 3-PRP or "any" PRP for that matter that has more than 2 prime factors? Are there any examples? I'm asking because we haven't found any with this effort. Gary |
|
|
|
|
|
#28 | ||
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5,881 Posts |
Quote:
Quote:
if not yes to gary's question Last fiddled with by henryzz on 2008-11-23 at 21:43 |
||
|
|
|
|
|
#29 |
|
Feb 2006
Denmark
2·5·23 Posts |
A007011: smallest pseudoprime to base 2 with n prime factors.
The base 3 sequence would start with 91, 286, 11011, 341341, 20821801. Found with PARI/GP: t=1;for(n=1,10^8,if(Mod(3,n)^(n-1)==1 && (b=bigomega(n))>t,\ print(n" "b" "factor(n));t=b)) 91 2 [7, 1; 13, 1] 286 3 [2, 1; 11, 1; 13, 1] 11011 4 [7, 1; 11, 2; 13, 1] 341341 5 [7, 1; 11, 2; 13, 1; 31, 1] 20821801 6 [7, 1; 11, 2; 13, 1; 31, 1; 61, 1] Change Mod(3,n) to use another base. It's inefficient so don't run for long. |
|
|
|
|
|
#30 |
|
I quite division it
"Chris"
Feb 2005
England
31·67 Posts |
Composite PRPs (with -f):
631020668*3^6-1 = 460014066971 = 570827 * 805873 631293542*3^3-1 = 17044925633 = 75377 * 226129 636386826*3^9-1 = 12526001896157 = 1615421 * 7754017 Lowest primes are: 631020668*3^41-1 631293542*3^26-1 636386826*3^17-1 |
|
|
|
|
|
#31 |
|
I quite division it
"Chris"
Feb 2005
England
40358 Posts |
Composite PRP:
682649738*3^4-1 = 55294628777 = 160637 * 344221 Lowest prime: 682649738*3^14-1 |
|
|
|
|
|
#32 |
|
Apr 2008
Antwerp, Belgium
3·19 Posts |
I'm just wondering, is it also possible for a prime which isn't a prp using the current available tests?
|
|
|
|
|
|
#33 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
133718 Posts |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Near- and quasi-repunit PRPs | Batalov | And now for something completely different | 10 | 2019-09-12 13:31 |
| Very (large) PRPs? | PawnProver44 | Information & Answers | 95 | 2016-05-20 18:24 |
| OEIS - (2^n-5)/3 - n odd - LLT-like algorithm for finding PRPs | T.Rex | Miscellaneous Math | 10 | 2015-09-01 18:07 |
| PRPs not prime | schickel | FactorDB | 1 | 2015-08-03 02:50 |
| Proven PRPs? | Random Poster | FactorDB | 0 | 2012-07-24 10:53 |