Related papers: Multiplicative representations of integers and Ram…
Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…
A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…
For $h \geq 1$, a $B_h$-set is a set of integers such that every integer $n$ has at most one representation in the form $n = a_{i_1} + \cdots + a_{i_h}$, where $a_{i_j} \in A$ for all $j = 1,\ldots, h$ and $a_{i_1} \leq \ldots \leq…
Let $A$ be an infinite set of nonnegative integers. For $h \geq 2$, let $hA$ be the set of all sums of $h$ not necessarily distinct elements of $A$. If every sufficiently large integer in the sumset $hA$ has at least two representations,…
For a fixed integer base $b\geq2$, we consider the number of compositions of $1$ into a given number of powers of $b$ and, related, the maximum number of representations a positive integer can have as an ordered sum of powers of $b$. We…
Let $\{U_n\}_{n \geqslant 0}$ and $\{G_m\}_{m \geqslant 0}$ be two linear recurrence sequences defined over the integers. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as…
For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…
Let $G$ be one of the classical Lie groups $\GL_{n+1}(\R)$, $\GL_{n+1}(\C)$, $\oU(p,q+1)$, $\oO(p,q+1)$, $\oO_{n+1}(\C)$, $\SO(p,q+1)$, $\SO_{n+1}(\C)$, and let $G'$ be respectively the subgroup $\GL_{n}(\R)$, $\GL_{n}(\C)$, $\oU(p,q)$,…
We prove an upper bound for the number of representations of a positive integer $N$ as the sum of four $k$-th powers of integers of size at most $B$, using a new version of the Determinant method developed by Heath-Brown, along with recent…
In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bases. The resulting numeral system has desirable properties…
In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…
For $\alpha >0$, let $$\mathscr{A}=\{ a_1<a_2<a_3<\cdots\}$$ and $$\mathscr{L}=\{ \ell_1, \ell_2, \ell_3,\cdots\} \quad \text{(not~necessarily~different)}$$ be two sequences of positive integers with $\mathscr{A}(m)>(\log m)^\alpha $ for…
Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best…
We give formulas for the number of representations of non negative integers by various quadratic forms. We also give evaluations in the case of sum of two cubes (cubic case) and the quintic case, as well. We introduce a class of generalized…
It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…
Romanov proved that a positive proportion of the integers have a representation as a sum of a prime and a power of an arbitrary fixed positive integer. Rieger proved the analogous result for number fields. We will determine an explicit…
Ramsey's theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set H such that all n-element subsets of H have the same color. The strength of consequences of Ramsey's theorem has…
By the theory of elliptic curves, we study the integers representable as the product of the sum of four integers with the sum of their reciprocals and give a sufficient condition for the integers with a positive representation.
Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_S(n)$ denote the number of solutions of the equation $n=s+s'$, $s, s'\in S$, $s<s'$. In this paper, we determine the…
For $m\geq 1$, let $0<b_0<b_1<...<b_m$ and $\ e_0,e_1,...,e_m>0$ be fixed positive integers. Assume there exists a prime $p$ and an integer $t>0$ such that $p^t\mid b_0$, but $p^t\nmid b_{i}\ {\rm for}\ 1\leq i\leq m$. Then, we prove that…