检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙智伟[1]
机构地区:[1]南京大学数学系
出 处:《Chinese Quarterly Journal of Mathematics》1991年第3期90-96,共7页数学季刊(英文版)
摘 要:The main result of this paper is as follows. Let n_o ∈ Z^+ be a period of the covering function σ (x)= 1. If d∈Z^+ divides some n_(l≤i≤k) and d|u_o,then the number of the n_i divided by d is at least d/(d,n.)where the notation (m,n) denotes the greatest common divicsor of m and n. In the case σ (x)≡1 it gives an improvement to the well-known Znám-Newman theorem,it is also better than the already announced result of Berger,Felzenbaum and Fraenkel.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.184