Talk:Numbers with prime digits whose sum is 13: Difference between revisions
Content added Content deleted
(Nice recursive solution) |
|||
| Line 3: | Line 3: | ||
# add each digit in the set of prime numbers to each digit in N (giving 22,23,..,75,77 first time) |
# add each digit in the set of prime numbers to each digit in N (giving 22,23,..,75,77 first time) |
||
# add any numbers whose digit sum is 13 to the sequence; |
# add any numbers whose digit sum is 13 to the sequence; |
||
# discard all numbers whose digit sum is greater than 11 from |
# discard all numbers whose digit sum is greater than 11 from N; |
||
# repeat until N is empty. |
# repeat until N is empty. |
||
--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 14:44, 21 October 2020 (UTC) |
--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 14:44, 21 October 2020 (UTC) |
||
== output from '''Ring''' ends too soon == |
== output from '''Ring''' ends too soon == |
||