...
首页> 外文期刊>INTEGERS: electronic journal of Combinatorial Number Theory >ON UNAVOIDABLE OBSTRUCTIONS IN GAUSSIAN WALKS
【24h】

ON UNAVOIDABLE OBSTRUCTIONS IN GAUSSIAN WALKS

机译:在高斯步行中的不可避免的障碍物

获取原文
   

获取外文期刊封面封底 >>

       

摘要

We investigate a problem about certain walks in the ring of Gaussian integers. Let n and d be two natural numbers. Does there exist a sequence of Gaussian integers zj , such that |zj+1 zj | = 1 and a pair of indices r and s, such that zr zs = n and for all indices t and u, zt zu 6= d? If there exists such a sequence, we say that n is d avoidable. Let An be the set of all d 2 N such that n is not d avoidable. Recently, Ledoan and Zaharescu proved that {d 2 N : d|n} ? An. We extend this result by giving a necessary and sucient condition for d 2 An, which answers a question posed by Ledoan and Zaharescu. We also find a precise formula for the cardinality of An and answer three other questions raised in the same paper.
机译:我们调查了一个关于高斯整数环中的某些散步的问题。让n和d是两个自然数。是否存在一系列高斯整数ZJ,这样的| ZJ + 1 ZJ | = 1和一对索引R和S,使得Zr zs = n和所有索引t和u,zt zu 6 = d?如果存在这样的序列,我们说n是可避免的。让一组是所有D 2 n,使得n不是d可避免的。最近,Ledoan和Zaharescu证明{D 2 N:D | n}?一个。我们通过为D 2 AN提供必要和成功的条件来扩展这一结果,这回答了Ledoan和Zaharescu提出的问题。我们还找到了一个精确的公式,以答案的基数,并回答同样纸张中提出的其他三个问题。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号