Related papers: A sum involving the greatest-integer function

Let $\{U_n\}$ be given by $U_0=1$ and $U_n=-2\sum_{k=1}^{[n/2]} \b n{2k}U_{n-2k}\ (n\ge 1)$, where $[\cdot]$ is the greatest integer function. In the paper we present a summation formula and several congruences involving $\{U_n\}$.

Let $[x]$ be the greatest integer not exceeding $x$. In the paper we introduce the sequence $\{U_n\}$ given by $U_0=1$ and $U_n=-2\sum_{k=1}^{[n/2]}\binom n{2k}U_{n-2k}\quad(n\ge 1)$, and establish many recursive formulas and congruences…

We study sums of arithmetic functions, defined on Gaussian integers and taken over those pairs of integers whose coordinates give rise to a singular system.

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \sigma(n)$ be the sum of divisors function. This note presents the first proof of the asymptotic formula for the average order $ \sum_{p\leq…

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…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The result $ \sum_{n\leq x}\varphi([x/n])=(6/\pi^2)x\log x+O\left ( x(\log x)^{2/3}(\log\log…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

Writing for a general mathematical audience, we provide elementary upper and lower bounds on the growth (as a function of N) of the sum \sum_{n=1}^N (-1)^{\floor{n x}} for various fixed x. For example, if x is a quadratic irrational, then…

We determine, within 1, the value of N for which sum (s1 choose i)(s2 choose N)(s1 choose N-i)(N choose i) achieves its maximum value. Here s1 and s2 are fixed integers. This problem arises in studying the most likely value for the size of…

Let $d(n)$ be the divisor function and denote by $[t]$ the integral part of the real number $t$. In this paper, we prove that $$\sum_{n\leq x^{1/c}}d\left(\left[\frac{x}{n^c}\right]\right)=d_cx^{1/c}+\mathcal{O}_{\varepsilon,c}…

For every integer $n\ge 1$ let $a_n$ be the smallest positive integer such that $n+a_n$ is prime. We investigate the behavior of the sequence $(a_n)_{n\ge 1}$, and prove asymptotic results for the sums $\sum_{n\le x} a_n$, $\sum_{n\le x}…

In this short, we study sums of the shape $\sum_{n\leqslant x}{f([x/n])}/{[x/n]},$ where $f$ is Euler totient function $\varphi$, Dedekind function $\Psi$, sum-of-divisors function $\sigma$ or the alternating sum-of-divisors function…

Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.

We give a characterization of all pairs $(k,n)$ of positive integers for which the ratio $$ \frac{1^k-2^k+3^k-\dots+(-1)^{n+1} n^k}{1^k-2^k+3^k-\dots+(-1)^{n}(n-1)^k} $$ of two consecutive alternating power sums is an integer.

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…

Let $A$ be an infinite set of nonnegative integers. For $h \geq 2$, let $hA$ be the set of all sums of $h$ not necessarily distinct elements of $A$. If every sufficiently large integer in the sumset $hA$ has at least two representations,…

We give an algorithm that produces all solutions of the equation $\sum_{i=1}^n 1/x_i = 1$ in integers of the form $2^a k^b$, where $k$ is a fixed positive integer that is not a power of $2$, $a$ is an element of $\{0,1,2\}$ that can vary…

Motivated by recent results, we study sums of the form $S_f(x) = \sum_{n\leq x} f\left(\left\lfloor\frac{x}{n}\right\rfloor \right)$, where $f$ is an arithmetic function and $\left\lfloor\cdot\right\rfloor$ denotes the greatest integer…

A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.

Let $N$ be any fixed positive integer and define \begin{align*} S_N(x)=\sum_{m, n \leq x}d(n^2+Nm^2), \end{align*} where $d(n)$ is the divisor function. We evaluate asymptotically $S_N(x)$ for several $N$, extending earlier works of Gafurov…