摘要
对于正整数n=akn^(n)10^kn+…+a0^(n),…,a0(n)是n位数码,记s(n)=akn^(n)+…+a0(n),sm(n)=(akn(n))m+…+(a0(n))m,称1^m2^m3^m4^m5^m6^m7^m8^m9^m1^m0^m1^m1^m1^m2^m3^m1^m4^m…是m阶位数码列,定义函数fm(χ)=1^m+2^mχ^1+…
For positive integer n = a 10kn + + a0, we say that a, a0 are the digits of n, and denote s(n) = a + + a0 ), sm(n) = (a) m + + (a))m. We call 1m2m3m4m5m6m7m8m9m 1m0m1m1m1m2m1m3m1m4m the m-order sequence of digits, and define the function fm (x) = 1m + 2mx1 + + 9mx8 + 1mx9 + 0x10 + 1mx11 + 1mx12+ . Two theorems on fm(x) are given.
出处
《数学学报(中文版)》
SCIE
CSCD
北大核心
2000年第2期221-224,共4页
Acta Mathematica Sinica:Chinese Series
基金
国家自然科学基金
浙江省自然科学基金
杭州师范学院科研基金