...
首页> 外文期刊>INTEGERS: electronic journal of Combinatorial Number Theory >ON WEAKLY COMPLETE SEQUENCES FORMED BY THE GREEDY ALGORITHM
【24h】

ON WEAKLY COMPLETE SEQUENCES FORMED BY THE GREEDY ALGORITHM

机译:在贪婪算法形成的弱完整序列上

获取原文

摘要

In this article, we consider increasing sequences of positive integers defined in the following manner. Let the initial terms a1 and a2 be given, and for any n > 2 define an to be the smallest integer greater than an?1 which can not be written as a sum of (distinct) previous terms of the sequence. For various parametrized choices of the initial terms, we determine precisely the terms of the sequences obtained by this method. We also conjecture that for all choices of the initial terms, even in a more general setting, the terms of sequences defined in this manner have interesting patterns.
机译:在本文中,我们考虑增加以下列方式定义的正整数的序列。给出初始术语A1和A2,并且对于任何n> 2定义一个是最小的整数,其最小的整数大于α1,其无法写成序列的前一个术语的(不同)的总和。对于初始术语的各种参数化选择,我们精确地确定了通过该方法获得的序列的术语。我们还猜测,对于初始术语的所有选择,即使在更常规的环境中,以这种方式定义的序列条款也具有有趣的模式。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号