benchmarks.wiki / Public workspace

Omni-MATH / For a set S of nonnegative integers, let r_(S)(n) denote the number of ordered pairs (s₁,s₂) such that s₁∈S, s₂∈S, s₁≠s₂, and s₁+s₂=n. Is it possible to partition the nonnegative i…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

For a set SS of nonnegative integers, let rS(n)r_S(n) denote the number of ordered pairs (s1,s2)(s_1, s_2) such that s1∈Ss_1 \in S, s2∈Ss_2 \in S, s1≠s2s_1 \ne s_2, and s1+s2=ns_1 + s_2 = n. Is it possible to partition the nonnegative integers into two sets AA and BB in such a way that rA(n)=rB(n)r_A(n) = r_B(n) for all nn?
Plain-text mathematical notation (without MathML)
For a set S of nonnegative integers, let r_(S)(n) denote the number of ordered pairs (s₁,s₂) such that s₁∈S, s₂∈S, s₁≠s₂, and s₁+s₂=n. Is it possible to partition the nonnegative integers into two sets A and B in such a way that r_(A)(n)=r_(B)(n) for all n?
Original LaTeX notation
For a set $S$ of nonnegative integers, let $r_S(n)$ denote the number of ordered pairs $(s_1, s_2)$ such that $s_1 \in S$, $s_2 \in S$, $s_1 \ne s_2$, and $s_1 + s_2 = n$. Is it possible to partition the nonnegative integers into two sets $A$ and $B$ in such a way that $r_A(n) = r_B(n)$ for all $n$?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import