Integers as Sums of Four Tetrahedral Numbers and Eight Pentatope Numbers in One Identity

Pub Date : 2023-04-10 DOI:10.1080/00029890.2023.2199652
Benjamin Lee Warren
{"title":"Integers as Sums of Four Tetrahedral Numbers and Eight Pentatope Numbers in One Identity","authors":"Benjamin Lee Warren","doi":"10.1080/00029890.2023.2199652","DOIUrl":null,"url":null,"abstract":"In 1850, Frederick Pollock [1] conjectured that every positive integer can be written as the sum of at most five tetrahedral numbers, where the nth tetrahedral number is given by Tn = 6n(n + 1)(n + 2). Earlier this year, Vadim Ponomarenko solved the weak version of Pollock’s conjecture [2] as Tn − Tn−1 − Tn−1 + Tn−2 = n. This solution is weak in the sense that it includes subtraction as well as addition instead of only addition. The following identity is a generalization of his solution at a = 2 and k = 1.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/00029890.2023.2199652","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In 1850, Frederick Pollock [1] conjectured that every positive integer can be written as the sum of at most five tetrahedral numbers, where the nth tetrahedral number is given by Tn = 6n(n + 1)(n + 2). Earlier this year, Vadim Ponomarenko solved the weak version of Pollock’s conjecture [2] as Tn − Tn−1 − Tn−1 + Tn−2 = n. This solution is weak in the sense that it includes subtraction as well as addition instead of only addition. The following identity is a generalization of his solution at a = 2 and k = 1.
分享
查看原文
整数作为一个单位中四个四面体数和八个五面体数的和
1850年,弗雷德里克·波洛克(Frederick Pollock)[1]推测每个正整数可以被写为最多5个四面体数的和,其中第n个四面体数由Tn = 6n(n + 1)(n + 2)给出。今年早些时候,瓦迪姆·波诺马伦科(Vadim Ponomarenko)解决了波洛克猜想[2]的弱版本为Tn−Tn−1−Tn−1 + Tn−2 = n。这个解是弱的,因为它包括减法和加法而不仅仅是加法。下面的恒等式是他在a = 2和k = 1时解的推广。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信