|
|
A275598
|
|
Primes p such that the number of odd divisors of p-1 is a prime q which is equal to the number of odd divisors of p+1.
|
|
4
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Conjecture: this sequence is finite.
Any further terms are greater than 2 * 10^12. - Dana Jacobsen, Aug 30 2016
|
|
LINKS
|
|
|
EXAMPLE
|
11 is in this sequence because there are 2 odd divisors 1 and 5 of 10 and there are 2 odd divisors 1 and 3 of 12, and 2 is a prime.
|
|
MAPLE
|
filter:= proc(p) local r, q;
r:= numtheory:-tau((p-1)/2^padic:-ordp(p-1, 2));
if not isprime(r) then return false fi;
r = numtheory:-tau((p+1)/2^padic:-ordp(p+1, 2))
end proc:
res:= NULL: p:= 0:
while p < 1000 do
p:= nextprime(p);
if filter(p) then
res:= res, p;
fi;
od:
|
|
MATHEMATICA
|
okQ[p_?PrimeQ] := Module[{r}, r = DivisorSigma[0, (p-1)/2^IntegerExponent[p-1, 2]]; If[!PrimeQ[r], Return[False]]; r == DivisorSigma[0, (p+1)/2^IntegerExponent[p+1, 2]]];
|
|
PROG
|
(Perl) use ntheory ":all"; forprimes { $n1 = scalar(grep { $_&1 } divisors($_-1)); say if is_prime($n1) && $n1 == scalar(grep { $_&1 } divisors($_+1)); } 1e7; # Dana Jacobsen, Aug 24 2016
(PARI) f(n)=numdiv(n>>valuation(n, 2))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|