aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

September 2017 Update

Browse source
This commit is contained in:
Ingy döt Net 2017-09-23 10:01:46 +02:00
parent bba7bfd280
commit ba8067c3b7
14570 changed files with 153136 additions and 63871 deletions
Download patch file Download diff file Expand all files Collapse all files

11
Task/Self-referential-sequence/00DESCRIPTION
View file

@ -14,8 +14,8 @@ Sort the digits largest to smallest. Do not include counts of digits that do not
Depending on the seed value, series generated this way always either converge to a stable value or to a short cyclical pattern. (For our purposes, I'll use converge to mean an element matches a previously seen element.) The sequence shown, with a seed value of 0, converges to a stable value of 1433223110 after 11 iterations. The seed value that converges most quickly is 22. It goes stable after the first element. (The next element is 22, which has been seen before.)
<b>Task:</b>
;Task:
Find all the positive integer seed values under 1000000, for the above convergent self-referential sequence, that takes the largest number of iterations before converging. Then print out the number of iterations and the sequence they return. Note that different permutations of the digits of the seed will yield the same sequence. For this task, assume leading zeros are not permitted.
<pre>Seed Value(s): 9009 9090 9900
@ -45,4 +45,11 @@ Sequence: (same for all three seeds except for first element)
19281716151413427110
19182716152413228110
</pre>
See also: [[Self-describing numbers]] and [[Look-and-say sequence]]
;Related tasks:
* &nbsp; [[Fours is the number of letters in the ...]]
* &nbsp; [[Look-and-say sequence]]
* &nbsp; [[Number names]]
* &nbsp; [[Self-describing numbers]]
* &nbsp; [[Spelling of ordinal numbers]]
<br><br>