首页> 美国政府科技报告 >Balanced Subset Sums of Dense Sets of Integers; Probability rept
【24h】

Balanced Subset Sums of Dense Sets of Integers; Probability rept

机译:密集整数集的平衡子集和;概率rept

获取原文

摘要

Given n different positive integers not greater than 2n-2, we prove that more than n(sup 2)/12 consecutive integers can be represented as the sum of half of the given numbers. This confirms a conjecture of Lev.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号