[go: up one dir, main page]

login
Revision History for A241922 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Smallest k^2>=0 such that n-k^2 is semiprime, or a(n)=2 if there is no such k^2.
(history; published version)
#55 by N. J. A. Sloane at Fri Dec 25 13:18:22 EST 2020
STATUS

editing

approved

#54 by N. J. A. Sloane at Fri Dec 25 13:18:18 EST 2020
COMMENTS

If n = m^2, m>=2, then the condition {a(n) differs from 2} is equivalent to the Goldbach binary conjecture. Indeed, if m^2 - k^2 is semiprime, then (m-k)*(m+k) = p*q, where p<=q are primes. Here we consider two possible cases. 1) m-k=1, m+k=p*q and 2) m-k=p, m+k=q. But in the first case k=m-1>m-p, i.e., more than k in the second case. In view of the minimality k, it is left we only have to consider case 2) only. In this case we have m-/+k both are primes p<=q (with equality in case k=0) and thus 2*m = p + q. Conversely, let the Goldbach conjecture be true. Then for a perfect square n>=4, we have 2*sqrt(n)=p+q (p<=q are both primes). Thus n=((p+q)/2)^2 and n-((p-q)/2)^2=p*q is semiprime. Hence, a(n) is a square not exceeding ((p-q)/2)^2.

All these numbers, are in A100570. Thus the Goldbach binary conjecture is true if and only if A100570 does not contain perfect squares.

The largest term found between [0..in the first 2^28] terms is a(106956964) = 369^2 (= 136161). Notably, this is "relatively close" to n, and This further encourages one to believe that Goldbach's binary conjecture holds true (but this doesn't explicitly demonstrate new knowledge). - Daniel Mikhail, Nov 23 2020

#53 by Michel Marcus at Sun Nov 29 01:10:53 EST 2020
STATUS

proposed

editing

Discussion
Sun Dec 20
07:21
OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review.  If it is ready for review, please
visit https://oeis.org/draft/A241922 and click the button that reads
"These changes are ready for review by an OEIS Editor."

Thanks.
  - The OEIS Server
#52 by Michel Marcus at Thu Nov 26 05:58:12 EST 2020
STATUS

editing

proposed

Discussion
Sun Nov 29
01:10
Michel Marcus: allo ?
#51 by Michel Marcus at Thu Nov 26 05:55:01 EST 2020
PROG

(PARI) a(n) = {my(lim = if (issquare(n), sqrtint(n)-1, sqrtint(n))); for (k=0, lim, if (bigomega(n-k^2) == 2, return (k^2)); ); return (2); } \\ Michel Marcus, Nov 26 2020

STATUS

proposed

editing

Discussion
Thu Nov 26
05:58
Michel Marcus: Notably, this is "relatively close" to n : I don't see ?
#50 by Michel Marcus at Mon Nov 23 11:56:32 EST 2020
STATUS

editing

proposed

Discussion
Mon Nov 23
12:06
Daniel Mikhail: Looks good to me, thanks!
#49 by Michel Marcus at Mon Nov 23 11:56:08 EST 2020
COMMENTS

The largest a(n) term found between [0..2^28] is a(106956964)=369^2 (136161). Notably, this is "relatively close" to n, and further encourages one to believe that Goldbach's binary conjecture holds true (but this doesn't explicitly demonstrate new knowledge). - Daniel Mikhail, Nov 23 2020

STATUS

proposed

editing

Discussion
Mon Nov 23
11:56
Michel Marcus: used "term" rather than "a(n)"
#48 by Daniel Mikhail at Mon Nov 23 11:53:50 EST 2020
STATUS

editing

proposed

#47 by Daniel Mikhail at Mon Nov 23 11:53:08 EST 2020
LINKS

Daniel Mikhail, <a href="https://raw.githubusercontent.com/mikhaidn/SemiprimeCalculations/main/Summary%20of%202%5E28%20results">Lists of up to the first 15 integers that are a squared distance, k^2, away from a semiprime for all k's found between [05..2^28]</a>

STATUS

proposed

editing

Discussion
Mon Nov 23
11:53
Daniel Mikhail: Swapped the ∆'s for k's
#46 by Michel Marcus at Mon Nov 23 10:48:21 EST 2020
STATUS

editing

proposed

Discussion
Mon Nov 23
10:48
Michel Marcus: rather like this
11:37
Daniel Mikhail: Looks good to me, thanks!