Abstract

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\mid r_{1}$$ such that $$R_{C}(n)=R_{D}(n)$$ for any nonnegative integer n.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.