摘要
讨论了黑白两种颜色的 k(k≥ 3)枚棋子的颜色变化问题。证明了 k =2 n(n=2 ,3,… )枚棋子最多经过 k次变换 T呈全黑 ,同时得出其他一些重要结论。
Color changing problem of two colors of black and white on k(k ≥3) chess stones was discussed. It is proved that all forms of k =2 n ( n =2,3,…) chess stones can be turned wholly black under no more than k times transformation T. Other important conclusions are also obtained.
出处
《西北大学学报(自然科学版)》
CAS
CSCD
北大核心
2000年第6期470-472,共3页
Journal of Northwest University(Natural Science Edition)
关键词
杨辉三解
变换T
第一类不动点
加法模型
Yang Hui triangle
transformation T
the first class fixed point
the second class fixed point