Let g(k) be the least integer > k + 1 such that all prime factors of (g(k)(k)) are greater than k . The function g(k) appears to show quite irregular behavior and is hard to compute. This paper describes a method of computing g(k) , using sieving techniques, and provides a table of values of g(k) for k less-than-or-equal-to 140 .
机构:
Chinese Acad Sci, Acad Math & Syst Sci, Inst Math, Beijing 100190, Peoples R ChinaChinese Acad Sci, Acad Math & Syst Sci, Inst Math, Beijing 100190, Peoples R China
Wang Yuan
Fang KaiTai
论文数: 0引用数: 0
h-index: 0
机构:
Chinese Acad Sci, Acad Math & Syst Sci, Inst Appl Math, Beijing 100190, Peoples R China
BNU HKBU United Int Coll, Zhuhai 519085, Peoples R ChinaChinese Acad Sci, Acad Math & Syst Sci, Inst Math, Beijing 100190, Peoples R China
WANG Yuan FANG KaiTai Institute of Mathematics Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China Institute of Applied Mathematics Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China BNUHKBU United International College Zhuhai China
论文数: 0引用数: 0
h-index: 0
WANG Yuan FANG KaiTai Institute of Mathematics Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China Institute of Applied Mathematics Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China BNUHKBU United International College Zhuhai China