Related papers: On polynomial representation functions for multili…

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…

We prove that for pairwise co-prime numbers $k_1,\dots,k_d \geq 2$ there does not exist any infinite set of positive integers $A$ such that the representation function $r_A (n) = \{ (a_1, \dots, a_d) \in A^d : k_1 a_1 + \dots + k_d a_d = n…

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…

Let $k\geq 2$ be a positive integer. We study concentration results for the ordered representation functions $r^{\leq}_k(A,n) = \# \big\{ (a_1 \leq \dots \leq a_k) \in A^k : a_1+\dots+a_k = n \big\}$ and $r^{<}_k(A,n) = \# \big\{ (a_1 <…

For a set $A$ of non-negative integers, let $R_A(n)$ denote the number of solutions to the equation $n=a+a'$ with $a$, $a'\in A$. Denote by $\chi_A(n)$ the characteristic function of $A$. Let $b_n>0$ be a sequence satisfying $\limsup_{n\to…

We investigate here the representability of integers as sums of triangular numbers, where the $n$-th triangular number is given by $T_n = n(n + 1)/2$. In particular, we show that $f(x_1,x_2,..., x_k) = b_1 T_{x_1} +...+ b_k T_{x_k}$, for…

Let $a_k(n)$ denotes the number of representations of a non-negative integer $n$ as sum of $k$ quadratic forms of the type $x^2+xy+y^2$ and $a_{\lambda_1,\lambda_2,\lambda_3\dots\lambda_k}(n)$ denotes the number of representations $n$ as a…

Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. For a $k$-tuple of positive integers $\underline{\lambda} = (\lambda_{1}, \dots{} ,\lambda_{k})$ with $1 \le \lambda_{1} < \lambda_{2} < \dots{} < \lambda_{k}$, we…

We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we…

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…

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

This paper deals with existence and multiplicity of positive solutions to the following class of nonlocal equations with critical nonlinearity: \begin{equation} \tag{$\mathcal E$} (-\Delta)^s u = a(x)…

This paper concerns the values of the Euler phi-function evaluated simultaneously on k arithmetic progressions a_1 n + b_1, a_2 n + b_2, ..., a_k n + b_k. Assuming the necessary condition that no two of the polynomials a_i x + b_i are…

For a set $A$ of nonnegative integers, let $R_2(A,n)$ and $R_3(A,n)$ denote the number of solutions to $n=a+a'$ with $a,a'\in A$, $a<a'$ and $a\leq a'$, respectively. In this paper, we prove that, if $A\subseteq \mathbb{N}$ and $N$ is a…

Given a linear equation of the form $a_1x_1 + a_2x_2 + a_3x_3 = 0$ with integer coefficients $a_i$, we are interested in maximising the number of solutions to this equation in a set $S \subseteq \mathbb{Z}$, for sets $S$ of a given size. We…

We show the existence of a constant $c > 0$ such that, for all positive integers $n$, there exist integers $1 \leq a_1 < \ldots < a_k \leq n$ such that there are at least $cn^2$ distinct integers of the form $\sum_{i=u}^{v}a_i$ with $1 \leq…

In this paper we use the theory of modular forms to find formulas for the number of representations of a positive integer by certain class of quadratic forms in eight variables, viz., forms of the form $a_1x_1^2 + a_2 x_2^2 + a_3 x_3^2 +…

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

Fix an integer $h \geq 2$, and let $b_1, \ldots, b_h$ be (not necessarily distinct) positive integers with $\gcd(b_1, \ldots, b_h) = 1$. For any subset $A \subseteq \mathbb{N}$, let $r_A(n)$ denote the number of solutions $(k_1, \ldots,…

It is proved that all sufficiently large integers $n$ can be represented as $$n=x_1^2+x_2^3+\cdots+x_{13}^{14},$$ where $x_1,\ldots,x_{13}$ are positive integers. This improves upon the current record with $14$ variables in place of $13$.