0%

Problem 277


Problem 277


A Modified Collatz sequence

A modified Collatz sequence of integers is obtained from a starting value a1 in the following way:

an+1 = an/3 if an is divisible by 3. We shall denote this as a large downward step, “D”.

an+1 = (4an + 2)/3 if an divided by 3 gives a remainder of 1. We shall denote this as an upward step, “U”.

an+1 = (2an - 1)/3 if an divided by 3 gives a remainder of 2. We shall denote this as a small downward step, “d”.

The sequence terminates when some an = 1.

Given any integer, we can list out the sequence of steps.
For instance if a1=231, then the sequence {an}={231,77,51,17,11,7,10,14,9,3,1} corresponds to the steps “DdDddUUdDD”.

Of course, there are other sequences that begin with that same sequence
“DdDddUUdDD….”.
For instance, if a1=1004064, then the sequence is
DdDddUUdDDDdUDUUUdDdUUDDDUdDD.
In fact, 1004064 is the smallest possible a1 > 106 that begins with the sequence
DdDddUUdDD.

What is the smallest a1 > 1015 that begins with the sequence
“UDDDUdddDDUDDddDdDddDDUDDdUUDd”?


变种考拉兹序列

由a1开始根据下列规则生成的整数数列被称为变种考拉兹序列:

an+1 = an/3,如果an能被3整除。这是一个较大的下降,我们记这一步操作为“D”。

an+1 = (4an + 2)/3,如果an除以3余1。这是一个较大的上升,我们记这一步操作为“U”。

an+1 = (2an - 1)/3,如果an除以3余2。这是一个较小的下降,我们记这一步操作为“d”。

一旦有an = 1,序列结束。

给定任意正整数,我们可以列出其操作步骤。
例如,若a1=231,整数数列{an}={231,77,51,17,11,7,10,14,9,3,1}对应的操作步骤是”DdDddUUdDD”。

当然,存在其它的整数数列其操作步骤的开头同样是”DdDddUUdDD….”。
例如,若a1=1004064,则操作步骤是DdDddUUdDDDdUDUUUdDdUUDDDUdDD。
事实上,1004064是在a1 > 106范围内,操作步骤以DdDddUUdDD开头的最小值。

在a1 > 1015范围内,操作步骤以”UDDDUdddDDUDDddDdDddDDUDDdUUDd”开头的最小值是多少?