Related papers: On Unique Additive Representations of Positive Int…

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…

If the equation of the title has an integer solution with k>=2, then m>10^{10^6}. Leo Moser showed this in 1953 by amazingly elementary methods. With the hindsight of more than 50 years his proof can be somewhat simplified. We give a…

If the equation 1^k+2^k+...+(m-2)^k+(m-1)^k=m^k has an integer solution with k>1, then m>10^{10^6}. Leo Moser showed this in 1953 by remarkably elementary methods. His proof rests on four identities he derives separately. It is shown here…

In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For…

Article presents a short investigation into some properties of the Moser polynomials which appear in various problems from algebraic combinatorics. For instance, these polynomials can be used to solve the Generalized Moser's Problem on…

For a fixed positive integer $m$ and any partition $m = m_1 + m_2 + \cdots + m_e$ , there exists a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that $$m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots+\frac{1}{n_{k}},$$ with the property…

An open conjecture of Erdos and Moser is that the only solution of the Diophantine equation in the title is the trivial solution 1+2=3. Reducing the equation modulo k and k^2, we give necessary and sufficient conditions on solutions to the…

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

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…

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

The Erd\"{o}s-Moser equation $ \sum_{i=1}^{m - 1} i^k = m^k $ is a longstanding challenge in number theory, with the only known integer solution being $ (k,m) = (1,3) $. Here, we investigate whether other solutions might exist by using the…

The Motzkin numbers $M_n=\sum_{k=0}^n\binom n{2k}\binom{2k}k/(k+1)$ $(n=0,1,2,\ldots)$ and the central trinomial coefficients $T_n$ ($n=0,1,2,\ldots)$ given by the constant term of $(1+x+x^{-1})^n$, have many combinatorial interpretations.…

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…

In this note we associate a sequence of non-negative integers to any convergent series of positive real numbers and study this sequence for the series $\sum_{n \geq 1} n^{-k}$ where $k$ is an integer $\geq 2$.

We show that sequences of positive integers whose ratios $a_n^2/a_{n+1}$ lie within a specific range are almost uniquely determined by their reciprocal sums. For instance, the Sylvester sequence is uniquely characterized as the only…

We mainly introduce two new kinds of numbers given by $$R_n=\sum_{k=0}^n\binom nk\binom{n+k}k\frac1{2k-1}\quad\ (n=0,1,2,...)$$ and $$S_n=\sum_{k=0}^n\binom nk^2\binom{2k}k(2k+1)\quad\ (n=0,1,2,...).$$ We find that such numbers have many…

Let $S_k(m):=1^k+2^k+\cdots+(m-1)^k$ denote a power sum. In 2011 Bernd Kellner formulated the conjecture that for $m\ge 4$ the ratio $S_k(m+1)/S_k(m)$ of two consecutive power sums is never an integer. We will develop some techniques that…

If A is a set of nonnegative integers containing 0, then there is a unique nonempty set B of nonnegative integers such that every positive integer can be written in the form a+b, where a\in A and b\in B, in an even number of ways. We…

This note is devoted to study the recurrent numerical sequence defined by: $a_0 = 0$, $a_n = \frac{n}{2} a_{n - 1} + (n - 1)!$ ($\forall n \geq 1$). Although, it is immediate that ${(a_n)}_n$ is constituted of rational numbers with…

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…