Related papers: An alternating sum of the floor function of square…

A curious identity of Bunyakovsky (1882), made more widely known by P\'olya and Szeg{\H o} in their ``Problems and Theorems in Analysis", gives an evaluation of a sum of the floor function of square roots involving primes $p\equiv…

We deduce asymptotic formulas for the alternating sums $\sum_{n\le x} (-1)^{n-1} f(n)$ and $\sum_{n\le x} (-1)^{n-1} \frac1{f(n)}$, where $f$ is one of the following classical multiplicative arithmetic functions: Euler's totient function,…

We study the sums $$ S_f(x) = \sum_{n\leq x} f\left(\left\lfloor\frac{x}{n}\right\rfloor\right) $$ when $f$ is supported on $r$th powers with $r\geq 2$. This restriction allows us to give nontrivial estimates for one of the error terms in…

In this paper we are concerned with a family of sums involving the floor function. With $r$ a non negative integer and $n$ and $m$ positive integers we consider the sums…

Let $x$ be a positive integer. We give an asymptotic formula for the number of primes in the set $\{\fl{x/n}, 1 \le n \le x\}$ and give some related results.

In this paper, we consider sums related the floor function. We can improve some previous results for some special arithmetic functions considered by Bordell\'es [3], Stucky[9] and Liu-Wu-Yang [6]. We can also give a refined result for…

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…

Let n and k be natural numbers and let S(n,k) denote the Stirling numbers of the second kind. It is a conjecture of Wilf that the alternating sum \sum_{j=0}^{n} (-1)^{j} S(n,j) is nonzero for all n>2. We prove this conjecture for all n not…

Let $(a_n)_{n\geq 0}$ be an arbitrary sequence and $(a_{\lfloor n/k \rfloor})_{n\geq 0}$ its dual floor sequence. We study infinite series and finite generalized binomial sums involving $(a_{\lfloor n/k \rfloor})_{n\geq 0}$. As applications…

A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the…

We study the function M(t,n) = Floor[ 1 / {t^(1/n)} ], where t is a positive real number, Floor[.] and {.} are the floor and fractional part functions, respectively. In a recent article in the Monthly, Nathanson proved that if log(t) is…

We show that all perfect odd integer squares not divisible by 3, can be usefully written as sqrt(N) = a + 18p, where the constant a is determined by the basic properties of N. The equation can be solved deterministically by an efficient…

We survey arithmetic and asymptotic properties of the alternating sum-of-divisors function $\beta$ defined by $\beta(p^a)=p^a-p^{a-1}+p^{a-2}-...+(-1)^a$ for every prime power $p^a$ ($a\ge 1$), and extended by multiplicativity. Certain open…

The present paper proves that if for a power sum $\alpha$ over $\ZZ$ the length of the period of the continued fraction for $\sqrt{\alpha(n)}$ is constant for infinitely many even (resp. odd) $n$, then $\sqrt{\alpha(n)}$ admits a functional…

We define A_n=\sum_{i=1}^n (-1)^i\frac{1}{i} and we show that, for every prime p, there exists a number n such that A_n\equiv 0 (mod p).

The floor and ceiling functions appear often in mathematics and manipulating sums involving floors and ceilings is a subtle game. Fortunately, the well-known textbook Concrete Mathematics provides a nice introduction with a number of…

In this study, the standard IEEE 754 2008 and modulo-based floor functions for rounding non-integers have been presented. Their effects on the accuracy of the bilinear interpolation algorithm have been demonstrated. The improved floor uses…

In this paper we consider the functional equation for alternating factorial sum and some of its particular solutions (alternating Kurepa's function $A(z)$ from [Petojevic_02] and function $A_{1}(z)$). We determine an extension of domain of…

We give an alternative proof of a formula that generalizes Hermite's identity. Instead involving modular arithmetic, our short proof relies on the Fourier-type expansion for the floor function and on a trigonometric formula.

$k$th-order sum-free functions are a natural generalization of APN functions using the concept of (non)vanishing flats. In this paper, we introduce a new combinatorial technique to study the nonvanishing flats of Boolean functions. This…