Talk:Sum of two adjacent numbers are primes: Difference between revisions
Talk:Sum of two adjacent numbers are primes (view source)
Revision as of 16:31, 19 December 2022
, 1 year ago→Task name odd and hard to understand ?
Line 20:
: 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)
| |||