Talk:Sum to 100: Difference between revisions
→extra credit
(→complete list of the number of solutions for zero ──► 300: added histograms to the output, added alignment as well.) |
|||
Line 31:
::: I might not be optimistic with AppleScript, but JavaScript and GHCi (the Haskell interpreter that comes with the GHC compiler) both seem quite relaxed about it when run from inside a code editor. Of course the data types and algorithm will make a difference :-) [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 01:01, 5 January 2017 (UTC)
:: For performance note that it is not necessary to generate the strings to count the solutions. There are 2 * 3 ** (base-2) possible strings. In base 2 the maximum value is 1 the minimum value -1. 0 can not be generated so 66% of values can be represented. The number of possible strings increases exponentially with the base, so to stretch this task for extra credit we could ask what is the %age in base 64, or 60 if we want to be Babylonian, or why not more. I often read that we use base 10 because we have 10 fingers, is there any archeological evidence that the Babylonians were severely deformed? --[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 12:54, 25 February 2017 (UTC)
==complete list of solutions for '''9'''==
| |||