arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.05732math.GM
收藏

$3n + 3^k$ 问题

$3n + 3^k$ Problem

Brno University of Technology(布尔诺理工大学)

David Barina, W. C. Maat

AI总结:

本文将Collatz问题推广为$3n + 3^k$问题,证明该序列收敛到经过$3^k$的循环,且其迭代序列与Collatz函数迭代序列相关联。

摘要:

Collatz问题被推广为$3n + 3^k$问题。证明显示,只要Collatz函数迭代收敛到经过数字1的循环,$3n + 3^k$序列就会收敛到经过数字$3^k$的循环,无论正整数$n$和$k$如何。证明显示,对于数字$3^k n$的$3n + 3^k$函数迭代序列,恰好是$n$的Collatz函数迭代序列乘以$3^k$。

英文摘要:

The Collatz problem is generalized into $3n + 3^k$ problem. It is shown that as long as the Collatz function iterates converge to the cycle passing through the number 1, the $3n + 3^k$ sequence converges to the cycle passing through the number $3^k$ for arbitrary positive integers $n$ and $k$. The proof shows that the sequence of $3n + 3^k$ function iterates for a number $3^k n$ is exactly the sequence of the Collatz function iterates for $n$ multiplied by $3^k$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑