Related papers: On the integer sets with the same representation f…
For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. We prove that if a sequence $B=\{11\leq b_1<b_2<\cdots\}$ satisfies $b_2=3b_1+5$, $b_3=3b_2+2$ and $b_{n+1}=3b_n+4b_{n-1}$ for all $n\geq 3$, then there is a sequence of…
In a typical regular expression (regex) crossword puzzle, you are given two nonempty lists $R_1,\ldots,R_m$ and $C_1,\ldots,C_n$ of regular expressions over some alphabet, and your goal is to fill in an $m\times n$ grid with letters from…
Let $\Bbb Z$ and $\Bbb N$ be the set of integers and the set of positive integers, respectively. For $a,b,c,d,n\in\Bbb N$ let $N(a,b,c,d;n)$ be the number of representations of $n$ by $ax^2+by^2+cz^2+dw^2$, and let $t(a,b,c,d;n)$ be the…
For any real number $s$, let $\sigma_s$ be the generalized divisor function, i.e., the arithmetic function defined by $\sigma_s(n) := \sum_{d \, \mid \, n} d^s$, for all positive integers $n$. We prove that for any $r > 1$ the topological…
Let $\Bbb Z$ and $\Bbb N$ be the set of integers and the set of positive integers, respectively. For $a,b,c,d,n\in\Bbb N$ let $N(a,b,c,d;n)$ be the number of representations of $n$ by $ax^2+by^2+cz^2+dw^2$, and let $t(a,b,c,d;n)$ be the…
Let $a_1,\ldots,a_m$ be nonzero integers, $c \in \mathbb Z$ and $r \ge 2$. The Rado number for the equation \[ \sum_{i=1}^m a_ix_i = c \] in $r$ colours is the least positive integer $N$ such that any $r$-colouring of the integers in the…
In this paper, we first prove that given a nonnegative integer $m$ and an odd number $t$ not divisible by $3$, there exists a unique Collatz's Sequence \[ S_{c}(m,t)=\{n_{0}(m,t),n_{1}(m,t),n_{2}(m,t),\ldots,n_{m}(m,t),n_{m+1}(m,t)\} \]…
We show that, for a positive integer $r$, every minimal 1-saturating set in ${\rm PG}(r-1,2)$ of size at least ${11/36} 2^r+3$ is either a complete cap or can be obtained from a complete cap $S$ by fixing some $s\in S$ and replacing every…
By using the complete discrimination system for polynomials, we study the number of positive solutions in {\small $C[0,1]$} to the integral equation {\small $\phi (x)=\int_0^1k(x,y)\phi ^n(y)dy$}, where {\small…
We consider the problem of describing all non-negative integer solutions to a linear congruence in many variables. This question may be reduced to solving the congruence $x_1 + 2x_2 + 3x_3 + ... + (n-1)x_{n-1} \equiv 0 \pmod n$ where values…
Two sets of nonnegative integers $A=\{a_1<a_2<\cdots\}$ and $B=\{b_1<b_2<\cdots\}$ are defined as \emph{disjoint}, if $\{A-A\}\bigcap\{B-B\}=\{0\}$, namely, the equation $a_i+b_t=a_j+b_k$ has only trivial solution. In 1984, Erd\H os and…
Let $\Bbb Z$ and $\Bbb N$ be the set of integers and the set of positive integers, respectively. For $a,b,c,d,n\in\Bbb N$ let $t(a,b,c,d;n)$ be the number of representations of $n$ by $ax(x-1)/2+by(y-1)/2+cz(z-1)/2 +dw(w-1)/2$…
Cusick's conjecture on the binary sum of digits $s(n)$ of a nonnegative integer $n$ states the following: for all nonnegative integers $t$ we have \[ c_t=\lim_{N\rightarrow\infty}\frac 1N\left\lvert\{n<N:s(n+t)\geq s(n)\}\right\rvert>1/2.…
Let A={a_s(mod n_s)}_{s=0}^k be a system of residue classes. With the help of cyclotomic fields we obtain a theorem which unifies several previously known results concerning system A. In particular, we show that if every integer lies in…
Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…
We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…
Let $D_{1}$, $D_{2}$ be coprime odd integers with min$(D_{1},D_{2})>1$, and let $N(D_{1},D_{2})$ denote the number of positive integer solutions $(x, m, n)$ of the equation $D_{1}x^2+D_{2}^{m}=2^{n+2}$. In this paper, we prove that…
Let $$\sum_{\substack{d|n\\ d\equiv 1 (2)}}\frac{1}{d}$$ denote the sum of inverses of odd divisors of a positive integer $n$, and let $c_{r}(n)$ be the number of representations of $n$ as a sum of $r$ squares where representations with…
A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B_2[g]-set is a set A of integers such that no integer has…
Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…