当前位置: X-MOL 学术J. Number Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Farey sequence and Graham's conjectures
Journal of Number Theory ( IF 0.7 ) Pub Date : 2020-12-24 , DOI: 10.1016/j.jnt.2020.10.013
Liuquan Wang

Let Fn be the Farey sequence of order n. For SFn we let Q(S)={x/y:x,yS,xy and y0}. We show that if Q(S)Fn, then |S|n+1. Moreover, we prove that in any of the following cases: (1) Q(S)=Fn; (2) Q(S)Fn and |S|=n+1, we must have S={0,1,12,,1n} or S={0,1,1n,,n1n} except for n=4, where we have an additional set {0,1,12,13,23} for the second case. Our results are based on Graham's GCD conjectures, which have been proved by Balasubramanian and Soundararajan.



中文翻译:

法里数列和格雷厄姆猜想

Fnn阶 Farey 序列。为了Fn 我们让 ()={X/X,,X 和 0}. 我们证明如果()Fn, 然后 ||n+1. 此外,我们证明在以下任何一种情况下:(1)()=Fn; (2)()Fn||=n+1,我们必须有 ={0,1,12,,1n} 要么 ={0,1,1n,,n-1n} 除了 n=4,我们有一个额外的集合 {0,1,12,13,23}对于第二种情况。我们的结果基于 Graham 的 GCD 猜想,该猜想已被 Balasubramanian 和 Soundararajan 证明。

更新日期:2020-12-24
down
wechat
bug