VOOZH about

URL: https://oeis.org/history?seq=A242244

⇱ The On-Line Encyclopedia of Integer Sequences (OEIS)


login

Showing entries 1-10 | older changes
Primes p such that both p^2 + 2 and p^2 - 2 are semiprimes.
#14 by Harvey P. Dale at Sat Apr 07 10:32:21 EDT 2018
STATUS
#13 by Harvey P. Dale at Sat Apr 07 10:32:16 EDT 2018
MATHEMATICA
STATUS
#12 by Michel Marcus at Sat May 17 01:50:07 EDT 2014
STATUS
#11 by Michael B. Porter at Fri May 16 23:31:17 EDT 2014
STATUS
#10 by Charles R Greathouse IV at Thu May 15 01:18:16 EDT 2014
STATUS
Discussion
Fri May 16
23:31
Michael B. Porter: Thank you, Charles.
#9 by Charles R Greathouse IV at Thu May 15 01:17:28 EDT 2014
NAME
COMMENTS
PROG
STATUS
Discussion
Thu May 15
01:18
Charles R Greathouse IV: If p > 3 is prime then p^2 = 1 mod 3 hence 3 | p^2 + 2.
#8 by K. D. Bajpai at Thu May 15 00:16:33 EDT 2014
STATUS
#7 by Alonso del Arte at Fri May 09 22:54:24 EDT 2014
COMMENTS
MATHEMATICA
STATUS
Discussion
Fri May 09
22:56
Alonso del Arte: Is it possible for both (p^2 + 2) and (p^2 - 2) to be semiprime but neither be divisible by 3? Why or why not?
Sat May 10
02:55
K. D. Bajpai: If both (p^2+2) and (p^2-2) be semiprimes then in all the cases (p^2+2) is divisible by 3, but in no case (p^2-2) is divisible by 3. Explored up to p(20000).
12:52
Alonso del Arte: This is a step in the right direction. But you need to go further, though. How do you know that your assertion won't suddenly fail for p(20001)? p(20002)? p(20003)? A mathematical proof is needed.
#6 by Wesley Ivan Hurt at Fri May 09 22:43:53 EDT 2014
STATUS
#5 by Wesley Ivan Hurt at Fri May 09 22:43:50 EDT 2014
CROSSREFS
STATUS