Talk:Numbers with prime digits whose sum is 13: Difference between revisions
Talk:Numbers with prime digits whose sum is 13 (view source)
Revision as of 14:44, 21 October 2020
, 3 years agoNice recursive solution
m (→task wording: added wording.) |
(Nice recursive solution) |
||
Line 1:
==Nice recursive solution==
Starting with a set N containing the set of prime digits 2,3,4,5:
# 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;
# discard all numbers whose digit sum is greater than 11 from the input set;
# repeat until N is empty.
--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 14:44, 21 October 2020 (UTC)
== output from '''Ring''' ends too soon ==
| |||