Talk:Strange plus numbers: Difference between revisions
→Help with Description: Replied to CalmoSoft.
(→Help with Description: Replied to CalmoSoft.) |
|||
| (One intermediate revision by one other user not shown) | |||
Line 17:
ok</lang> --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 10:55, 23 February 2021 (UTC)
:::@Chunes If the condition is "the sum of two consecutive digits is always prime", then one-digit numbers should be considered strange (it's [https://en.wikipedia.org/wiki/Vacuous_truth vacuously true] that for all pairs of consecutive digits the sum is prime). In the C solution I added a condition on n<10 to force them to be non-strange, but it's easy to remove. We could change the task to solve the general solution and decide what to do with one-digit numbers (I think it's better to have them strange). [[User:Bastet|Bastet]] ([[User talk:Bastet|talk]]) 13:33, 24 February 2021 (UTC)
Hello PureFox. I changed the code as you suggested (CalmoSoft)
:Good, thanks. Incidentally, I was just adding a Go entry to your [[https://rosettacode.org/wiki/Strange_numbers Strange numbers]] task, when I noticed there was a similar problem with your Ring entry. Same fix again, I think :) --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 10:14, 25 February 2021 (UTC)
| |||