Related papers: Settling some sum suppositions

Let $\mathfrak{B}$ denote the collection of odd primitive Gaussian integers and $n\mapsto b(n)$ denote the characteristic function of elements of $\mathfrak{B}$. We prove that the exponential sum $ S(\alpha; N)=\sum_{n\le…

We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…

Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…

The statistical physics approach to the number partioning problem, a classical NP-hard problem, is both simple and rewarding. Very basic notions and methods from statistical mechanics are enough to obtain analytical results for the phase…

From the Rhind Papyrus and other extant sources, we know that the ancient Egyptians were very iterested in expressing a given fraction into a sum of unit fractions, that is fractions whose numerators are equal to 1. One of the problems that…

In this paper, we prove a necessary and sufficient condition for the Lucas-Carmichael integers in terms of the sum of base-$p$ digits. We also study some interesting properties of such integers. Finally, we prove that there are infinitely…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

In this paper we describe a new method of obtaining ideal solutions of the well-known Tarry-Escott problem, that is, the problem of finding two distinct sets of integers $x_i,\;i=1,\,2,\,\dots,\,k+1$ and $y_i,\;i=1,\,2,\,\dots,\,k+1$ such…

In difference algebra, summability arises as a basic problem upon which rests the effective solution of other more elaborate problems, such as creative telescoping problems and the computation of Galois groups of difference equations. In…

Let b $\ge$ 2 be an integer and let s b (n) denote the sum of the digits of the representation of an integer n in base b. For sufficiently large N , one has Card{n $\le$ N : |s 3 (n) -- s 2 (n)| $\le$ 0.1457205 log n} \textgreater{} N…

We address three questions posed by Bibak \cite{KB20}, and generalize some results of Bibak, Lehmer and K G Ramanathan on solutions of linear congruences $\sum_{i=1}^k a_i x_i \equiv b \Mod{n}$. In particular, we obtain explicit expressions…

In this paper we suggest analytical methods and associated algorithms for determining the sum of the subsets $X_m$ of the set $X_n$ (subset sum problem). Our algorithm has time complexity $T=O(C_{n}^{k})$ ($k=[m/2]$, which significantly…

In this paper, we consider the fractional sum of the divisor functions. We can improve previous results considered by Bordell\'{e}s \cite{Bo} and Liu-Wu-Yang \cite{LWY}.

We present an extension of the Prouhet-Tarry-Escott problem by demonstrating that signed sums of noninteger powers of consecutive integers can be made arbitrarily close to zero.

In this paper, we derive a formula for the sums of powers of the first $n$ positive integers, $S_k(n)$, that involves the hyperharmonic numbers and the Stirling numbers of the second kind. Then, using an explicit representation for the…

This article proposes a unified analytical approach leading to a partial resolution of the Erdos-Straus, Sierpinski conjectures, and their generalization. We introduce an equivalent reformulation of these conjectures while constructing two…

The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…

We report about some results, interesting examples, problems and conjectures revolving around the parabolic Kostant partition functions, the parabolic Kostka polynomials and ``saturation'' properties of several generalizations of the…

Let $s(n)$ denote the sum of digits in the binary expansion of the integer $n$. Hare, Laishram and Stoll (2011) studied the number of odd integers such that $s(n)=s(n^2)=k$, for a given integer $k\geq 1$. The remaining cases that could not…

Let $d(n)$ and $d^{\ast}(n)$ be the numbers of divisors and the numbers of unitary divisors of the integer $n\geq1$. In this paper, we prove that \[ \underset{n\in\mathcal{B}}{\underset{n\leq x}{\sum}}\frac{d(n)}{d^{\ast}% (n)}=\frac{16\pi%…