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

Content added Content deleted

Inline

Latest revision as of 10:24, 20 December 2022

Task name odd and hard to understand ?

The existing task name seems logically and grammatically a bit obscure. Hard work to disentangle.

"Sum of two adjacent numbers are primes" ??

What is the subject of "are primes" ?

"Sum" ? But then why "are" and a plural ?

Or perhaps "adjacent numbers" ?

But I don't think anyone will find all that many "adjacent" numbers (beyond 3) that are both prime.

Does it perhaps mean "Prime sums of two consecutive numbers" ?

Might that seem a clearer title ? Or perhaps I've still misunderstood ? Hout (talk) 14:26, 18 December 2022 (UTC)

"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. --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. --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. --Nigel Galloway (talk) 16:31, 19 December 2022 (UTC)

@@ Line 11: / Line 11: @@
 Or perhaps "adjacent numbers" ?
-But I think nobody has (or will) find all that many "adjacent" numbers (beyond 3) that are both prime.
+But I don't think 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: / 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. It really is that trivial. --[[User:Petelomax|Petelomax]] ([[User talk:Petelomax|talk]]) 20:50, 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)