On a problem of the Schur
For any positive integer n, let r be the positive integer such that the set 1, 2, …, r can be partitioned into n classes, and no any class contain integers x, y, z with xy=z. In reference 1 (See Problem 57), Schur asked us to find the maximum r. In this paper, we use the elementary methods to study this problem, and give a sharp lower bound estimates for r.
Schurs problem partition lower bound.
Yani Zheng
Department of Mathematics, Northwest University, Xian, Shaanxi, P.R.China Department of Mathematics, Xianyang Normal College, Xianyang, Shaanxi, P.R.China
国际会议
西安
英文
1-2
2008-03-21(万方平台首次上网日期,不代表论文的发表时间)