Let $S \subseteq \mathbb Z$ be such that $\mathbb Z \setminus S$ is finite , then is it true that there exists infinite $ S_1,S_2 \subseteq \mathbb Z$ such that $S_1+S_2=S$ and for every $s \in S $ , there exists unique $s_1\in S_1 , s_2 \in S_2$ such that $s=s_1+s_2$ ?
2026-03-25 14:25:32.1774448732
An analogue of direct sum decomposition of a cofinite subset of integers
166 Views Asked by user228169 https://math.techqa.club/user/user228169/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in ADDITIVE-COMBINATORICS
- Exercise 1.1.6 in Additive Combinatorics
- Show that $A+B$ contains at least $m+n-1$ elements.
- Advantage of Fourier transform on $\mathbb{Z}_N$
- Sorting on non-additive ratios
- Asymptotic formula for the integral sequence s(n)
- Show that $|A+A| < 2.5 |A| $ with $A = \{ [n \sqrt{2}] : 1 \leq n \leq N \}$
- show that $[n \sqrt{3}]$ is an approximate group
- A combinatoric solution (closed expression) for $\sum_{k=i}^n \binom{n}{k}p^k(1-p)^{n-k}$
- On Gowers' approach of Green-Tao Theorem ($\mathcal{D}f$s span $L^q(\mathbb{Z}_N)$).
- Is that specific function additive under disjoint union?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Yes, but for a trivial reason. Just enumerate $S=\{c_1,c_2,\dots\}$ and construct the sets $S_1=\{a_1,a_2,\dots\}$ and $S_2=\{b_1,b_2,\dots$ inductively as follows. Suppose that $a_j,b_j$ are already defined for $j<m$ Choose the least $k$ such that $c_k$ is not of the kind $a_i+b_j$ and choose $a_m$ very large negative and $b_m$ very large positive so that $a_m+b_m=c_k$. Then the addition of $a_m$ to $S_1$ and $b_m$ to $S_2$ won't destroy the properties $S_1+S_2\subset S$ (Here is the only place where the cofiniteness of $S$ is used: we need to know that all numbers large enough in absolute values are in $S$, so sums like $a_m+b_j$, $j<m$ are there. In fact, the (upper) density $1$ will suffice too) and the representation uniqueness if they were there before, but now $c_k$ will be also representable as a sum.