Talk:Sum and product puzzle: Difference between revisions
→Scala
Walterpachl (talk | contribs) (→Scala: new section) |
(→Scala) |
||
Line 13:
val step3 = step2 filter { prodEq(_).intersect(step2).size == 1 }
: step2 filters the step0 integer pairs for pairs where "For every possible sum decomposition of the number X+Y, the product has in turn more than one product decomposition"
: step3 filters the set defined by step2 for pairs where "The number X*Y has only one product decomposition for which fact 1 is true"
: Perhaps the Haskell or JavaScript versions might seem more legible ? [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 17:35, 21 October 2016 (UTC)
| |||