{"title":"关于具有相同表示函数的有限非负整数集合","authors":"Cui-Fang Sun","doi":"10.1007/s11139-024-00903-9","DOIUrl":null,"url":null,"abstract":"<p>Let <span>\\(\\mathbb {N}\\)</span> be the set of all nonnegative integers. For <span>\\(S\\subseteq \\mathbb {N}\\)</span> and <span>\\(n\\in \\mathbb {N}\\)</span>, let the representation function <span>\\(R_{S}(n)\\)</span> denote the number of solutions of the equation <span>\\(n=s+s'\\)</span> with <span>\\(s, s'\\in S\\)</span> and <span>\\(s<s'\\)</span>. In this paper, we determine the structure of <span>\\(C, D\\subseteq \\mathbb {N}\\)</span> with <span>\\(C\\cup D=[0, m]\\)</span>, <span>\\(C\\cap D=\\{r_{1}, r_{2}\\}\\)</span>, <span>\\(r_{1}<r_{2}\\)</span> and <span>\\(2\\not \\mid r_{1}\\)</span> such that <span>\\(R_{C}(n)=R_{D}(n)\\)</span> for any nonnegative integer <i>n</i>.</p>","PeriodicalId":501430,"journal":{"name":"The Ramanujan Journal","volume":"161 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On finite nonnegative integer sets with identical representation functions\",\"authors\":\"Cui-Fang Sun\",\"doi\":\"10.1007/s11139-024-00903-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Let <span>\\\\(\\\\mathbb {N}\\\\)</span> be the set of all nonnegative integers. For <span>\\\\(S\\\\subseteq \\\\mathbb {N}\\\\)</span> and <span>\\\\(n\\\\in \\\\mathbb {N}\\\\)</span>, let the representation function <span>\\\\(R_{S}(n)\\\\)</span> denote the number of solutions of the equation <span>\\\\(n=s+s'\\\\)</span> with <span>\\\\(s, s'\\\\in S\\\\)</span> and <span>\\\\(s<s'\\\\)</span>. In this paper, we determine the structure of <span>\\\\(C, D\\\\subseteq \\\\mathbb {N}\\\\)</span> with <span>\\\\(C\\\\cup D=[0, m]\\\\)</span>, <span>\\\\(C\\\\cap D=\\\\{r_{1}, r_{2}\\\\}\\\\)</span>, <span>\\\\(r_{1}<r_{2}\\\\)</span> and <span>\\\\(2\\\\not \\\\mid r_{1}\\\\)</span> such that <span>\\\\(R_{C}(n)=R_{D}(n)\\\\)</span> for any nonnegative integer <i>n</i>.</p>\",\"PeriodicalId\":501430,\"journal\":{\"name\":\"The Ramanujan Journal\",\"volume\":\"161 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Ramanujan Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s11139-024-00903-9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Ramanujan Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11139-024-00903-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
让(\mathbb {N}\)是所有非负整数的集合。对于 \(S\subseteq \mathbb {N}\)和 \(n\in \mathbb {N}\),让表示函数 \(R_{S}(n)\) 表示方程 \(n=s+s'\) 的解的个数,其中 \(s, s'\in S\) 和 \(s<s'\).在本文中,我们确定了 \(C, Dsubseteq \mathbb {N}\) with \(C\cup D=[0, m]\), \(C\cap D=\{r_{1}, r_{2}\}), \(r_{1}<;r_{2}\) and\(2\not \mid r_{1}\) such that \(R_{C}(n)=R_{D}(n)\) for any nonnegative integer n.
On finite nonnegative integer sets with identical representation functions
Let \(\mathbb {N}\) be the set of all nonnegative integers. For \(S\subseteq \mathbb {N}\) and \(n\in \mathbb {N}\), let the representation function \(R_{S}(n)\) denote the number of solutions of the equation \(n=s+s'\) with \(s, s'\in S\) and \(s<s'\). In this paper, we determine the structure of \(C, D\subseteq \mathbb {N}\) with \(C\cup D=[0, m]\), \(C\cap D=\{r_{1}, r_{2}\}\), \(r_{1}<r_{2}\) and \(2\not \mid r_{1}\) such that \(R_{C}(n)=R_{D}(n)\) for any nonnegative integer n.