Related papers: A sum involving the greatest-integer function
This article establishes a new upper bound on the function $\sigma^{*}(n)$, the sum of all coprime divisors of $n$. The article concludes with two questions concerning this function.
In this paper, we study some supercongruences involving the sequence $$ t_n(x)=\sum_{k=0}^n\binom{n}{k}\binom{x}{k}\binom{x+k}{k}2^k $$ and solve some open problems. For any odd prime $p$ and $p$-adic integer $x$, we determine…
An algebraic integer is said large if all its real or complex embeddings have absolute value larger than $1$. An integral ideal is said \emph{large} if it admits a large generator. We investigate the notion of largeness, relating it to some…
In this note we use recent results concerning the sum theorem for maximal monotone multifunctions in general Banach spaces to find new characterizations and properties of regular maximal monotone multifunctions and then use these to…
We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…
Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…
We define a function by refining Stern's diatomic sequence. We name it the {\it assembly function}. It is strictly increasing continuous. The first and the second main theorems are on an action to the function. The third theorem is on…
Given an additively written abelian group $G$ and a set $X\subseteq G$, we let $\mathsf{D}(X)$ denote the Davenport constant of $X$, namely the largest non-negative integer $n$ for which there exists a sequence $x_1, \dots, x_n$ of elements…
In a recent author's work the cyclic behavior of maxima in a hierarchical summation scheme was discovered. In the present note we show how the same phenomenon appears in the scheme of conventional summation: the distribution of maximum of…
Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…
Convex functions have played a major role in the field of Mathematical inequalities. In this paper, we introduce a new concept related to convexity, which proves better estimates when the function is somehow more convex than another. In…
Let $\gcd(k,j)$ denote the greatest common divisor of the integers $k$ and $j$, and let $r$ be any fixed positive integer. Define $$ M_r(x; f) := \sum_{k\leq x}\frac{1}{k^{r+1}}\sum_{j=1}^{k}j^{r}f(\gcd(j,k)) $$ for any large real number…
We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…
We improve some results on the size of the greatest prime factor of integers of the form ab+1, where a and b belong to finite sets of integers with rather large density.
We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…
If n is a positive integer, let h(n) denote the maximal value of the product of distinct primes whose sum does not exceed n. We give some properties of this function h and describe an algorithm able to compute h(n) for large values of n.
A recurrence relations for sums of powers of complex functions can be written as a system of linear equation AX=B. Using properties of determinant and Cramer's rule for solving systems of linear equation, this paper presents an absolutely…
We give the q-analogue of the sums of the n-th powers of positive integers up to k-1.
Aggregation functions are generally defined and used to combine several numerical values into a single one, so that the final result of the aggregation takes into account all the individual values in a given manner. Such functions are…
Let $f(n)$ denote the number of unordered factorizations of a positive integer $n$ into factors larger than $1$. We show that the number of distinct values of $f(n)$, less than or equal to $x$, is at most $\exp \left( C \sqrt{\frac{\log…