Related papers: A common approach to three open problems in number…

Given an integer linear recurrence sequence $\langle X_n \rangle_n$, the Skolem Problem asks to determine whether there is a natural number $n$ such that $X_n = 0$. Recent work by Lipton, Luca, Nieuwveld, Ouaknine, Purser, and Worrell…

This paper is concerned with the problem of finding two sets of integers, $\{a_1, a_2, \ldots$, $a_m\}$ and $\{b_1, b_2, \ldots, b_n\}$, such that all the $mn$ sums $a_i+b_j, i=1, \ldots, m, j=1, \ldots, n$, are perfect squares. A method is…

The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the…

In this paper we consider the seating couple problem with an even number of seats, which, using graph theory terminology, can be stated as follows. Given a positive even integer $v=2n$ and a list $L$ containing $n$ positive integers not…

Consider the following prediction problem. Assume that there is a block box that produces bits according to some unknown computable distribution on the binary tree. We know first $n$ bits $x_1 x_2 \ldots x_n$. We want to know the…

For each positive integer $m$, the $m$th order harmonic numbers are given by $$H_n^{(m)}=\sum_{0<k\le n}\frac1{k^m}\ \ (n=0,1,2,\ldots).$$ We discover exact values of some series involving harmonic numbers of order not exceeding four. For…

We are interested in solutions of a norm form equation that takes values in a given multi-recurrence. We show that among the solutions there are only finitely many values in each component which lie in the given multi-recurrence unless the…

In this note we prove a selection of commutativity theorems for various classes of semigroups. For instance, if in a separative or completely regular semigroup $S$ we have $x^p y^p = y^p x^p$ and $x^q y^q = y^q x^q$ for all $x,y\in S$ where…

Let H be a k-uniform hypergraph whose vertices are the integers 1,...,N. We say that H contains a monotone path of length n if there are x_1 < x_2 < ... < x_{n+k-1} so that H contains all n edges of the form {x_i,x_{i+1},...,x_{i+k-1}}. Let…

Let $N_q$ be the number of solutions to the equation $$ (a_1^{}x_1^{m_1}+\dots+a_n^{}x_n^{m_n})^k=bx_1^{k_1}\cdots x_n^{k_n} $$ over the finite field $\mathbb F_q=\mathbb F_{p^s}$. Carlitz found formulas for~$N_q$ when…

The paper considers the following nonhomogeneous Schr\"odinger-Maxwell system -\Delta u + u+\lambda\phi (x) u =|u|^{p-1}u+g(x),\ x\in \mathbb{R}^3, -\Delta\phi = u^2, \ x\in \mathbb{R}^3, . \leqno{(SM)} where $\lambda>0$, $p\in(1,5)$ and…

The paper deals with the following system of nonlinear difference equations \begin{equation*} x_{n+1}=ax_{n}^{2}y_{n}+bx_{n}y_{n}^{2},\ y_{n+1}=cx_{n}^{2}y_{n}+dx_{n}y_{n}^{2},\ n\in \mathbb{N}_{0}, \end{equation*} where the initial values…

We revisit a work by R. Okazaki and prove that for every cubic binary form F(x, y) with large enough discriminant, the Thue equation |F(x, y)| = 1 has at most 7 solutions in integers x and y.

The 3x+1 semigroup is the multiplicative semigroup generated by the rational numbers of form (2k+1)/(3k+2) for non-negative k, together with 2. This semigroup encodes backward iteration under the 3x+1 map, and the 3x+1 conjecture implies…

In this article we prove that equation $\phi(x)=n$, for a fixed $n$, admits a finite number of solutions, we find the general form of these solutions, and we show that: if $x_0$ is a unique solution of this equation then $x_0$ is a product…

We consider equation systems of the form X_1 = f_1(X_1, ..., X_n), ..., X_n = f_n(X_1, ..., X_n) where f_1, ..., f_n are polynomials with positive real coefficients. In vector form we denote such an equation system by X = f(X) and call f a…

Let $G$ be a finite group. The aim of this paper is to study the number of solutions $S\subseteq G$ of the equation $\mho^{\{n\}}(S)=L$, where $L$ is a non-empty subset of $G$, $n$ is a positive integer and $\mho^{\{n\}}(S)=\{ s^n \ | \…

In his book "250 Problems in Elementary Number Theory", W.Sierpinski shows that the numbers 1+2^(2^n)+2^(2^n+1) are divisible by 21; for n=1,2,.... In this paper, we prove a similar but more general result.Consider the natural numbers of…

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

We demonstrate a kind of linear superposition for a large number of nonlinear equations, both continuum and discrete. In particular, we show that whenever a nonlinear equation admits solutions in terms of Jacobi elliptic functions…