Talk:Sum of two adjacent numbers are primes: Difference between revisions

Talk:Sum of two adjacent numbers are primes (view source)

326 bytes added , 1 year ago

m

9,655

edits

Revision as of 20:50, 18 December 2022 (view source) Petelomax (talk \| contribs) (→‎Task name odd and hard to understand ?) ← Older edit		Latest revision as of 10:24, 20 December 2022 (view source) Hout (talk \| contribs) m (→‎Task name odd and hard to understand ?)
(2 intermediate revisions by 2 users not shown)
Line 11: Or perhaps "adjacent numbers" ? But I don't think ~~nobody has (or~~anyone will) find all that many "adjacent" numbers (beyond 3) that are both prime. Does it perhaps mean "Prime sums of two consecutive numbers" ? Line 19: : "Prime sums of two consecutive numbers" fits the task. I am not sure I have the perspective to say whether it's easier to comprehend than the current title. --[[User:Rdm\|Rdm]] ([[User talk:Rdm\|talk]]) 14:43, 18 December 2022 (UTC) : This is not one of the more well-thought-out tasks. It basically boils down to find ''every'' odd prime p and show it as the "sum" of floor(p/2) '+' ceil(p/2). Adjacent numbers just means n and n+1. Omit say 4+5 as 9 is not prime. It ''really'' is that trivial. --[[User:Petelomax\|Petelomax]] ([[User talk:Petelomax\|talk]]) 20:50, 18 December 2022 (UTC) : Mathematically more interesting is Sum of adjacent squares is prime, i.e. 4+9=13. The "basically boils down to..." could be used, but more interesting (efficient?) methods are known. --[[User:Nigel Galloway\|Nigel Galloway]] ([[User talk:Nigel Galloway\|talk]]) 16:31, 19 December 2022 (UTC)