Theorem of mutations in a numeral sequence

[dimension10]

I have observed a strange thing when you modify a sequence of numbers bit by bit.

 

[BWElbert]

I have read your paper, but I am a bit perplexed by the last line:

'You will notice that no matter what the X and Y sequences are n-n2.'

What do you mean by this? If you mean that the sequences are of length n - n₂, then this is not true as n = n₂ = 3 in your example.

I am always interested in theorems regarding numerical strings, but I feel that your paper did not quite convey the theorem you are wanting to give us.

Any way you can simply write out the theorem without any example? If not, maybe rephrase your last line/paragraph to better explain this.

Ben

 

[ramsey2879]

I have read your paper, but I am a bit perplexed by the last line:

'You will notice that no matter what the X and Y sequences are n-n2.'

What do you mean by this? If you mean that the sequences are of length n - n₂, then this is not true as n = n₂ = 3 in your example.

I am always interested in theorems regarding numerical strings, but I feel that your paper did not quite convey the theorem you are wanting to give us.

Any way you can simply write out the theorem without any example? If not, maybe rephrase your last line/paragraph to better explain this.

Ben

I think he meant n = n2 not n-n2
Edit but that can't be right since it dosn't work for the mutation ABCDE->BAECD.