Problem 51246. Characterize the final state of another digit inventory sequence

Created by ChrisR

Solve Later

{"parts":[{"partUri":"/matlab/document.xml","contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?><w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Cody Problems </w:t></w:r><w:hyperlink w:docLocation=\"https://www.mathworks.com/matlabcentral/cody/problems/46122-find-the-nth-term-in-the-digit-inventory-sequence\"><w:r><w:rPr/><w:t>46122</w:t></w:r></w:hyperlink><w:r><w:rPr/><w:t> and </w:t></w:r><w:hyperlink w:docLocation=\"https://www.mathworks.com/matlabcentral/cody/problems/46571\"><w:r><w:rPr/><w:t>46571</w:t></w:r></w:hyperlink><w:r><w:rPr/><w:t> involved a digit inventory sequence in which one term in the sequence describes the previous. For example, if one term is 411, the next would be 2114: two 1’s, one 4. For some starting numbers, the sequence reaches a steady state, but for others, the terms oscillate.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>A different form of a digit inventory is formed by listing the counts of </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>all</w:t></w:r><w:r><w:t> digits—in the order 1-9 and 0—and concatenating them for the next term in the sequence. If the initial seed is 570, then the next three terms would be </w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[0000101001, 3000000007, 0010001008]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>The first term arises because 570 has zero 1s, 2s, 3s, and 4s; one 5; zero 6s, one 7; zero 8s and 9s; and one 0. The second term arises because the first has three 1s, seven 0s, and zero of everything else. If we continue to generate terms, we will find that the seventh and eighth terms will repeat. </w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>At first, I thought that this sequence always reaches a state in which these same two terms oscillate, but I have since found a few seeds that lead to a steady state. </w:t></w:r><w:r><w:t> </w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Write a function that takes a seed as a string and determines the number of the term at which the final state begins and the period of the repeated terms. Take the initial seed to be term 1. </w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Optional: The function is not required to return the terms themselves, but the terms in the final state are interesting. The seeds in the test suite lead to only two sets of final terms. Can you find seeds that lead to different final terms? </w:t></w:r></w:p></w:body></w:document>","relationship":null}],"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","target":"/matlab/document.xml","relationshipId":"rId1"}]}

<div style = "text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; "><div style="block-size: 370.433px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 185.217px; transform-origin: 407px 185.217px; vertical-align: baseline; "><div style="block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 49.7917px 7.91667px; transform-origin: 49.7917px 7.91667px; unicode-bidi: normal; "><span style="">Cody Problems </span></span><a target='_blank' href = "https://www.mathworks.com/matlabcentral/cody/problems/46122-find-the-nth-term-in-the-digit-inventory-sequence"><span style=""><span style="">46122</span></span></a><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 15.5583px 7.91667px; transform-origin: 15.5583px 7.91667px; unicode-bidi: normal; "><span style=""> and </span></span><a target='_blank' href = "https://www.mathworks.com/matlabcentral/cody/problems/46571"><span style=""><span style="">46571</span></span></a><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 264.525px 7.91667px; transform-origin: 264.525px 7.91667px; unicode-bidi: normal; "><span style=""> involved a digit inventory sequence in which one term in the sequence describes the previous. For example, if one term is 411, the next would be 2114: two 1’s, one 4. For some starting numbers, the sequence reaches a steady state, but for others, the terms oscillate.</span></span></div><div style="block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 210.283px 7.91667px; transform-origin: 210.283px 7.91667px; unicode-bidi: normal; "><span style="">A different form of a digit inventory is formed by listing the counts of </span></span><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 7.00833px 7.91667px; transform-origin: 7.00833px 7.91667px; unicode-bidi: normal; "><span style="font-style: italic; ">all</span></span><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 158.325px 7.91667px; transform-origin: 158.325px 7.91667px; unicode-bidi: normal; "><span style=""> digits—in the order 1-9 and 0—and concatenating them for the next term in the sequence. If the initial seed is 570, then the next three terms would be </span></span></div><div style="background-color: rgb(247, 247, 247); block-size: 20.4333px; border-bottom-left-radius: 4px; border-bottom-right-radius: 4px; border-end-end-radius: 4px; border-end-start-radius: 4px; border-start-end-radius: 4px; border-start-start-radius: 4px; border-top-left-radius: 4px; border-top-right-radius: 4px; margin-block-end: 10px; margin-block-start: 10px; margin-bottom: 10px; margin-inline-end: 3px; margin-inline-start: 3px; margin-left: 3px; margin-right: 3px; margin-top: 10px; perspective-origin: 404px 10.2167px; transform-origin: 404px 10.2167px; margin-left: 3px; margin-top: 10px; margin-bottom: 10px; margin-right: 3px; "><div style="background-color: rgba(0, 0, 0, 0); border-bottom-left-radius: 0px; border-bottom-right-radius: 0px; border-end-end-radius: 0px; border-end-start-radius: 0px; border-inline-end-color: rgb(233, 233, 233); border-inline-end-style: solid; border-inline-end-width: 0.833333px; border-inline-start-color: rgb(233, 233, 233); border-inline-start-style: solid; border-inline-start-width: 0.833333px; border-left-color: rgb(233, 233, 233); border-left-style: solid; border-left-width: 0.833333px; border-right-color: rgb(233, 233, 233); border-right-style: solid; border-right-width: 0.833333px; border-start-end-radius: 0px; border-start-start-radius: 0px; border-top-left-radius: 0px; border-top-right-radius: 0px; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; min-block-size: 18px; min-height: 18px; padding-inline-start: 4px; padding-left: 4px; white-space: nowrap; "><span style="block-size: auto; border-inline-end-color: rgb(0, 0, 0); border-inline-end-style: none; border-inline-end-width: 0px; border-inline-start-color: rgb(0, 0, 0); border-inline-start-style: none; border-inline-start-width: 0px; border-left-color: rgb(0, 0, 0); border-left-style: none; border-left-width: 0px; border-right-color: rgb(0, 0, 0); border-right-style: none; border-right-width: 0px; display: inline; margin-inline-end: 45px; margin-right: 45px; min-block-size: 0px; min-height: 0px; padding-inline-start: 0px; padding-left: 0px; perspective-origin: 130.9px 7.91667px; transform-origin: 130.9px 7.91667px; unicode-bidi: normal; white-space: pre; margin-right: 45px; "><span style="margin-inline-end: 0px; margin-right: 0px; ">0000101001, 3000000007, 0010001008</span></span></div></div><div style="block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 10px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 10px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 10px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 361.7px 7.91667px; transform-origin: 361.7px 7.91667px; unicode-bidi: normal; "><span style="">The first term arises because 570 has zero 1s, 2s, 3s, and 4s; one 5; zero 6s, one 7; zero 8s and 9s; and one 0. The second term arises because the first has three 1s, seven 0s, and zero of everything else. If we continue to generate terms, we will find that the seventh and eighth terms will repeat. </span></span></div><div style="block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 381.933px 7.91667px; transform-origin: 381.933px 7.91667px; unicode-bidi: normal; "><span style="">At first, I thought that this sequence always reaches a state in which these same two terms oscillate, but I have since found a few seeds that lead to a steady state. </span></span><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 1.94167px 7.91667px; transform-origin: 1.94167px 7.91667px; unicode-bidi: normal; "><span style=""> </span></span></div><div style="block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 381.817px 7.91667px; transform-origin: 381.817px 7.91667px; unicode-bidi: normal; "><span style="">Write a function that takes a seed as a string and determines the number of the term at which the final state begins and the period of the repeated terms. Take the initial seed to be term 1. </span></span></div><div style="block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 371.042px 7.91667px; transform-origin: 371.042px 7.91667px; unicode-bidi: normal; "><span style="">Optional: The function is not required to return the terms themselves, but the terms in the final state are interesting. The seeds in the test suite lead to only two sets of final terms. Can you find seeds that lead to different final terms? </span></span></div></div></div>

Solve

Solution Stats

14 Solutions
9 Solvers

Last Solution submitted on Mar 12, 2023

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

William on 28 Mar 2021

Chris, we agree on everything except cases 11, 13 and 14. In those, I get a value of n that is smaller by 1.

ChrisR on 28 Mar 2021

I think the problem is in line 20 of your code. Notice that we agree except for the cases with period 1. I checked that our codes produce the same terms for cases 1 and 11.

William on 28 Mar 2021

Thanks Chris. You wrote very clearly that n was to be the 'start' of the periodic behavior, counting the initial seed as n=1, but somehow I took it to be something else. That's an interesting discovery about the final term. I tried 100,000 random seeds up to 12-digits and didn't find anything other than the two final values you mention.

ChrisR on 28 Mar 2021

I thought about possible final values because there's a constraint on the digits of terms after the initial seed. I haven't been able to think up another possible final state. Are there only two final states?

Solution Comments

Solution 8855990

1 Comment

1 Comment

GeeTwo on 2 Aug 2022

Oops - meant to hit run function and hit submit. I only had run it with '53'; turns out I DID need that eleventh element on the bins. I could swear I got 11 bins when I did 48:58 earlier.

Problem Recent Solvers9

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 51246. Characterize the final state of another digit inventory sequence

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers9

Suggested Problems

More from this Author191

Problem Tags

Community Treasure Hunt

Problem 51246. Characterize the final state of another digit inventory sequence

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers9

Suggested Problems

More from this Author191

Problem Tags

Community Treasure Hunt

Players