Skip to main content

All Questions

2 votes
1 answer
111 views

Maximal size of bounded “sparse” sets of natural numbers

Let’s call $A \subset \mathbb{N}$ sparse iff for all quadruples of distinct numbers $(a, b, c, d)$ from $A$ it is true, that $a + b \neq c + d$. What is the maximal possible size of a sparse set $A$, ...
Chain Markov's user avatar
  • 15.7k
2 votes
1 answer
96 views

Construct an set $A\in\mathbb{N}$ such that $\delta(A)$ exists, but $\delta(A\cap(A+1))$ doesn't exist, where $A+1=\{a+1:a\in A\}$.

Definition: For $A\subset\mathbb{N},$ define the natural density of A to be: $\delta(A)=\lim_{N\rightarrow\infty}\frac{|A\cap\{1,\dots,N\}|}{N}$. We say $\delta(A)$ doesn't exist if the limit $\lim_{N\...
WLOG's user avatar
  • 1,336
1 vote
0 answers
36 views

On the cardinality of the set $ A(m) := \{ (a, b) \in \mathbb{N}^2 : \; N \leq a \leq 2 N, \; a^2 - b^2 = m \}, $

Question: Consider the set $$ A(m) := \{ (a, b) \in \mathbb{N}^2 : \; N \leq a \leq 2 N, \; a^2 - b^2 = m \}, $$ where $ \mathbb{Z} \ni m < 0$ and $N \in \mathbb{N} \setminus \{ 0 \}$. Then ...
Marcelo Ng's user avatar
8 votes
2 answers
434 views

How to show that $\gcd(a_1,a_2,\cdots,a_k) = 1$ implies that there exist a non-negative solution to $\sum_{i=1}^{n}a_ix_i = n$ for large $n.$

I was reading about the Coin-problem and I am unable to fully understand the following argument: On the other hand, whenever the GCD equals 1, the set of integers that cannot be expressed as a ...
Student's user avatar
  • 9,258
6 votes
0 answers
131 views

Odd of the form $a^2+b^2+c^2+ab+ac+bc$.

The computation below shows that (for $a,b,c \in \mathbb{N}$) the form $$a^2+b^2+c^2+ab+ac+bc$$ covers every odd integer less than $10^5$ except those in $$I= \{ 5, 15, 23, 29, 41, 53, 59, 65, ...
Sebastien Palcoux's user avatar
3 votes
0 answers
65 views

Product set in a finite field

For a finite nonempty subset $A$ of a ring $X=(X,+,\cdot)$, let us denote the set $\{a \cdot b \colon a, b \in X\}$. If $X=\mathbb{Z}$, it is not difficult to show that $$|AA| \leq \frac{|A|^{2}+|...
Jamai-Con's user avatar
  • 577
1 vote
0 answers
45 views

Asymptotic formula for the integral sequence s(n)

Prove that there exists a sequence $A_{0}, A_{1}$, . . . of rational polynomials $A_{i}(x)\in \mathrm{Q}[x]$ with $A_{i}$ of degree $i$ such that $$ s(n)=\frac{n^{n-1}}{(1-\log 2)^{n-1/2}e^{n}}(\sum_{...
MathMorty's user avatar
3 votes
0 answers
65 views

Maximal number of subsets of $n$ real numbers that have the same sum, when $2^{n-2}$ of subsets have "unique" sums

I've recently found a problem that I still can't solve: Dependency of the properties of numbers' subsets concerning subsets' sums of $n$ real numbers. A problem linked with it, that may be ...
user509680's user avatar
19 votes
2 answers
645 views

Sumset that covers $\mathbb{Z}/p\mathbb{Z}$.

Let $p$ be a prime. Let $S$ be a set of residues modulo $p$. Define $$S^2 = \{a \cdot b \mid a \in S, b \in S\}.$$ Question: How small can we make $|S|$ such that $\{0, 1, \cdots, p-2, p-1\} \in ...
Sandeep Silwal's user avatar
5 votes
2 answers
358 views

Is there any formula for this sum of power of positive integers? [duplicate]

I wonder if there is any formula for this sum. $$k^\gamma+(k-1)^\gamma+\cdots+1^\gamma,$$ where $k$ is positive integer and $\gamma\in(0,1)$. And how about $\gamma<0$? Or is there any known ...
Connor's user avatar
  • 2,075
1 vote
0 answers
60 views

Partitioning a progression

Let $P $ be a $Z_N $ progression of length $R $.Prove that we can partition $P $ into at most $4 \sqrt R $ genuine arithmetic progressions. (Genuine arithmetic progression means arithmetic ...
user115608's user avatar
  • 3,493
4 votes
1 answer
326 views

Application of Cauchy-Davenport

Let $ p $ be a prime number and $ A \subset \mathbb{Z}/p\mathbb{Z} $. Suppose $ 0 \notin A $ and for $ a \in A $ define $ d(a)= \min\{k|-a \in \underbrace{A+A+ \dots +A}_\text{k times} \} $. I want ...
Andrei's user avatar
  • 1,085
1 vote
1 answer
164 views

Changing powers to sums in a simple system of equations

Let's say we have the system of $l$ equations below: $$ \left\{ \begin{array}{c} a_{11}^{a_{12}}=a_{13} \\ a_{21}^{a_{22}}=a_{23} \\ \ldots \\ a_{l1}^{a_{l2}}=a_{l3} \\ \end{array} \right. $$ ...
sdd's user avatar
  • 451
8 votes
1 answer
164 views

An analogue of direct sum decomposition of a cofinite subset of integers

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 $ , ...
user avatar
1 vote
1 answer
51 views

Subset of $\mathbb{Z}_n$ and zero sum

Let $a_1, a_2, \ldots, a_n$ be elements of $\mathbb{Z}_n$. Prove that there exist $r$ and $s$ such that $\sum_{i=r}^s a_i \equiv 0 \pmod n$ (with $1 \leq r \leq s \leq n$). Do you have any hint? I ...
Albert's user avatar
  • 145

15 30 50 per page