Goodstein Sequence: Difference between revisions
Content deleted Content added
m →{{header|Julia}}: Using a generic vector instead of an inheritance tree of elements is faster here, for once. |
m To avoid needing big integer types the Goodstein(n)(n) task has to have n < 11. |
||
| Line 35: | Line 35: | ||
* Use this to show the first 10 values of Goodstein(n) for the numbers from 0 through 7. |
* Use this to show the first 10 values of Goodstein(n) for the numbers from 0 through 7. |
||
* Find the nth term (counting from 0) of Goodstein(n) for n from 0 through |
* Find the nth term (counting from 0) of Goodstein(n) for n from 0 through 10. |
||
<br /> |
<br /> |
||
| Line 41: | Line 41: | ||
;Stretch task |
;Stretch task |
||
* Find the nth term (counting from 0) of Goodstein(n) for n = 16. |
* Find the nth term (counting from 0) of Goodstein(n) for n = 11 through 16. |
||
<br /><br /> |
<br /><br /> |
||