Partitions of nonnegative integers with identical representation functions

Abstract

Let N be the set of all nonnegative integers. For any integer r and m, let r+mN=\r+mk: k∈N\. For S⊂eq N and n∈ N, let RS(n) denote the number of solutions of the equation n=s+s' with s, s'∈ S and s<s'. Let r1, r2, m be integers with 0<r1<r2<m and 2 r1. In this paper, we prove that there exist two sets C and D with C D=N and C D=(r1+mN) (r2+mN) such that RC(n)=RD(n) for all n∈N if and only if there exists a positive integer l such that r1=22l+1-2, r2=22l+1-1, m=22l+2-2.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…