![]() |
|
|
#23 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36·13 Posts |
Quote:
You appear to look but not see. (Also explains your endless threads with miniature results.) Look carefully at these first two lines (posted before) -- Code:
----- -------------------------------- ------- ----- ---- -------------- rank description digits who year comment ----- -------------------------------- ------- ----- ---- -------------- 46623 2*3^152529+1 72776 gb 2000 Divides Phi(3^152528,2) 88279 2*3^6225+1 2971 C 1992 Divides Phi(3^6223,2) 94491 2*3^4217+1 2013 C 1992 Divides Phi(3^4217,2) |
|
|
|
|
|
|
#24 | |
|
Feb 2017
Nowhere
4,643 Posts |
I tried to find a precise description of the "divides phi" category, without success. The "Divides Phi" page here features
Quote:
As long as the divisor m is small enough (which it certainly is in the proffered examples), the fact that k*b^n + 1 divides Phi((b^n)/m,2) still proves that k*b^n + 1 is prime. So saying "it doesn't fit the category" is at best a minor quibble. Perhaps some leeway could be included in the "Definitions and notes" part of the Divides Phi page, reflecting that the fact k*b^n + 1 "divides phi" also proves it prime. |
|
|
|
|
|
|
#25 |
|
"Daniel Jackson"
May 2011
14285714285714285714
3·13·17 Posts |
@Batalov: Please tell me where to get DivPhi! I've been wanting to download it for over a month now.
|
|
|
|
|
|
#26 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
100101000001012 Posts |
What could it be?
/scratches head/ |
|
|
|
|
|
#27 |
|
"Daniel Jackson"
May 2011
14285714285714285714
3·13·17 Posts |
Remove me form your ignore list right now! I want to use that program.
|
|
|
|
|
|
#28 | |
|
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
5×7×83 Posts |
Quote:
|
|
|
|
|
|
|
#29 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36·13 Posts |
The category is called "Divides Phi".
Not "Divides Phi(b^n,2)". Quote:
This category also should have restrictions -- otherwise any prime "Divides Something". |
|
|
|
|
|
|
#30 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36·13 Posts |
Quote:
Isn't it self-explanatory using just this one post why you are on the ignore list? And with posts like this you are not going to get off it, I can guarantee you that. |
|
|
|
|
|
|
#31 | |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
23·1,223 Posts |
Quote:
|
|
|
|
|
|
|
#32 |
|
"Daniel Jackson"
May 2011
14285714285714285714
3×13×17 Posts |
Because I want to know where/how to download DivPhi. I've been waiting for weeks on end, with no download link or anything. Please give me a download link.
Last fiddled with by Stargate38 on 2019-03-07 at 21:53 |
|
|
|
|
|
#33 | |
|
Feb 2017
Nowhere
4,643 Posts |
Quote:
I did flag the modifier "self-compiled" as possibly important. Of course "binary" is important; I would hazard a guess that whether a precompiled binary actually works would depend very much on the system you try to run it on. OK, enough of me proclaiming my ignorance for now... |
|
|
|
|
![]() |
| 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 |