Few things I don't understand:
>>>Basically you find all the numbers less than the the first n primes multiplied together, p_n#, and coprime to it. Then isolate the twins, then find their central numbers. E.G. 12 for (11,13) and 18 for (17,19) then you find the gap between them. 6 in the example above. For 2*3*5=30 the centers are 0,12,18,30. So the largest gap is 12
Are we counting (29,31) as twin primes here?
>>>The wheels are symmetric so you really only need to search the first half taking care to double the middle gap. So in our example above I count to 15, noting the gap of 12 then count 3 more to get to 15, double that to get 6. 12 is bigger than 6 so keep that. No need to do 30-18, that's just 12 again.
Not following this; "count to 15, noting gap of 12..". Where is this gap of 12 in the list up to 15? I think you meant "center?" Or maybe it's a center of 12 which is a gap of 12 from 0... unclear on how you're handling the edge cases, but I think you're including them, and then here stating that the biggest gap you find below halfway point only then requires checking how far to midpoint for one other case...would be nice if I understood better.
>>>Why? Well any element of the set < p_n^2 is prime if the maximum gap is < p_n^2 then no matter how well orchestrated the primes are in eliminating twin elements then there will always be some twin elements that are prime.
Not sure I follow this, but I'm kinda being lazy at this point. Claude did mention something about this, so I think I could sort if out if I put my mind to it.
YODL
npub162…atdhy
2026-07-21 15:25:32 UTC
in reply to nevent1q…hsfc
Author Public Key
npub162zpxufpw8pnuytaf0gfxzkqtvk9rvcwkvppa7x57y3n7qkfpg4shatdhyPublished at
2026-07-21 15:25:32 UTCEvent JSON
{
"id": "9cc51c15fb1d76aac1974e95284e531e2bce0b24ceb138e77fb6b10e77704c87",
"pubkey": "d28413712171c33e117d4bd0930ac05b2c51b30eb3021ef8d4f1233f02c90a2b",
"created_at": 1784647532,
"kind": 1,
"tags": [
[
"e",
"14d372e106e763a101b96dc11660013d3cf1687c74b1fea42057d75341de01fa",
"wss://nostr.wine/",
"root",
"d28413712171c33e117d4bd0930ac05b2c51b30eb3021ef8d4f1233f02c90a2b"
],
[
"e",
"51cebb17482bb8b35cea30a907178c71f59b4b65cce7ef61341d095c20c33e61",
"wss://relay.primal.net/",
"reply",
"75656740209960c74fe373e6943f8a21ab896889d8691276a60f86aadbc8f92a"
],
[
"p",
"75656740209960c74fe373e6943f8a21ab896889d8691276a60f86aadbc8f92a"
]
],
"content": "Few things I don't understand:\n\n\u003e\u003e\u003eBasically you find all the numbers less than the the first n primes multiplied together, p_n#, and coprime to it. Then isolate the twins, then find their central numbers. E.G. 12 for (11,13) and 18 for (17,19) then you find the gap between them. 6 in the example above. For 2*3*5=30 the centers are 0,12,18,30. So the largest gap is 12\nAre we counting (29,31) as twin primes here?\n\n\u003e\u003e\u003eThe wheels are symmetric so you really only need to search the first half taking care to double the middle gap. So in our example above I count to 15, noting the gap of 12 then count 3 more to get to 15, double that to get 6. 12 is bigger than 6 so keep that. No need to do 30-18, that's just 12 again.\nNot following this; \"count to 15, noting gap of 12..\". Where is this gap of 12 in the list up to 15? I think you meant \"center?\" Or maybe it's a center of 12 which is a gap of 12 from 0... unclear on how you're handling the edge cases, but I think you're including them, and then here stating that the biggest gap you find below halfway point only then requires checking how far to midpoint for one other case...would be nice if I understood better.\n\n\u003e\u003e\u003eWhy? Well any element of the set \u003c p_n^2 is prime if the maximum gap is \u003c p_n^2 then no matter how well orchestrated the primes are in eliminating twin elements then there will always be some twin elements that are prime.\nNot sure I follow this, but I'm kinda being lazy at this point. Claude did mention something about this, so I think I could sort if out if I put my mind to it.",
"sig": "78f722646f413e54695209ad61e47eb98ec66d03be3bbfa0b8de76fd0a6d7b2fcfeebf9200a98a74cc8591c06d850a822b7a1638bd7d50a92b9d512188edbc59"
}