Related papers: Binary Additive Problems: Recursions for Numbers o…

Let $a=(a_1,\ldots,a_n)$ and $b=(b_1,\ldots,b_n)$ be two $n$-tuples of positive integers, let $X$ be a set of positive integers, and let $g$ be a positive integer. In this work we show an algorithmic process in order to compute all the sets…

We obtain solutions to the recursive sequences of the form $$x_{n + 1} = \frac{x_{n - 3}x_{n }}{x_{n - 2}(a_n + b_nx_{n -3}x_{n})}$$ where $a_n$ and $b_n$ are arbitrary sequences of real numbers, and the initial values are gives as;…

We develop an analytic approach that draws on tools from Fourier analysis and ergodic theory to study Ramsey-type problems involving sums and products in the integers. Suppose $Q$ denotes a polynomial with integer coefficients. We establish…

We prove a generalization of W.M. Schmidt's theorem related to the Diophantine approximations for a linear form of the type $\alpha_1x_1+\alpha_2x_2 +y$ with {\it positive} integers $x_1,x_2$.

For a set of natural numbers $A$, let $R_{A}(n)$ be the number of representations of a natural number $n$ as the sum of two terms from $A$. Many years ago, Nathanson studied the conditions for the set $A$ and $B$ of natural numbers that are…

We consider a generalisation of the classical Lehmer problem about the parity distribution of an integer and its modular inverse. We use some known estimates of exponential sums to study a more general question of simultaneous distribution…

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…

Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…

In this paper, we study the "sum composition problem" between two lists $A$ and $B$ of positive integers. We start by saying that $B$ is "sum composition" of $A$ when there exists an ordered $m$-partition $[A_1,\ldots,A_m]$ of $A$ where $m$…

We generalize the well known Glaisher partition bijection result. For given positive integers n, d, both greater than 1, we provide a rich family of bijections between the set of partitions of n where at least one part is divisible by d,…

Two sets $A,B$ of positive integers are called \emph{exact additive complements}, if $A+B$ contains all sufficiently large integers and $A(x)B(x)/x\rightarrow1$. Let $A=\{a_1<a_2<\cdots\}$ be a set of positive integers. Denote $A(x)$ by the…

We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y)| \leq h$, where $F(x , y)$ is a sparse binary form, with integer coefficients, and $h$ is a sufficiently small integer in terms of the…

We introduce the subsum polynomial of a partition $\lambda=(\lambda_1, \lambda_2, \ldots, \lambda_k)$ defined by $\mathrm{sp}(\lambda, x)=\prod_{i=1}^k(1+x^{\lambda_i})$. We study the sum of reciprocals of $\mathrm{sp}(\lambda, x)$ over all…

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…

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…

We study the problem of constructing positive representations of complex measures. In this paper we consider complex densities on a direct product of $U(1)$ groups and look for representations by probability distributions on the…

Let $h$ and $l$ be integers such that $0\le h\le 2$, $0\le l\le 4$. We obtain asymptotic formulas for the numbers of solutions of the equations $n-3m=h$, $n-5m=l$ in positive integers $m$ and $n$ of a special kind, $m\le X$.

This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…

We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…