Anonymous user
Talk:Sum to 100: Difference between revisions
moved a section of comments from the task's preamble to the talk page.
(→a discussion of the task's requirements and wording: moved comments from the task's requirements to the talk page.) |
(moved a section of comments from the task's preamble to the talk page.) |
||
Line 402:
sums of 211 219 221 227 229 233 235 239 241 247 277 284 286 287 300 have the minimum number of solutions: 0
</pre>
==a discussion of the task's requirements and wording==
This (first) section of comments was moved here to the ''talk'' page from the task's requirements. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 18:12, 11 July 2017 (UTC)
Note: If you allow/disallow negative first numbers you do get different results. If you allow negative first numbers, which you should according to the specification; then you get at least two targets with the same highest number of solutions: The positive and negative versions of the same target, only the positive one is between 0 to 123456789. The specification assumes there is only one positive target with the maximum number of solutions. It is worth looking for multiple targets with the same number of solutions, just in case there are more. This is especially true if you try the variants with different lists of digits. For example using the digits '987654321' and excluding a negative first number comes up with two distinct targets with the same maximum number of solutions, both of which happen to be positive. If you are playing with the asymetric version with out leading negative numbers of different lists of digits the sums with the highest number of solution may only be negative. In this case it is worth excluding the test to show only positive totals and put up with seeing duplicate +ve and -ve solutions.
Robin Murison
:::::: Added signature of Robin Murison by [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 18:12, 11 July 2017 (UTC)
| |||