首页> 美国政府科技报告 >Note on a Reconstruction Problem for Number Sequences
【24h】

Note on a Reconstruction Problem for Number Sequences

机译:关于数列的重构问题的注记

获取原文

摘要

The authors consider the following problem: for which values of n can the211u001esequence a(sub 1),...,a(sub n) of real numbers be reconstructed (up to order) 211u001efrom the sequence S(sub 1),...,S(sub m) of the sums a(sub i) + a(sub j) (1 < or + 211u001ei < j < or + n, m = ((sup n)(sub 2))). The answer is positive for n = 3, 5, 6, 211u001eand its negative for n = 2(sup k) (k > or = 0).

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号