Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
0 answers
89 views

Partial sums involving Gregory coefficients that cannot be an integer

For integers $n\geq 1$ let $G_n$ be the Gregory coefficients or reciprocal logarithmic numbers, see the Wikipedia [Gregory coefficients.] (https://en.wikipedia.org/wiki/Gregory_coefficients) $${z\...
user142929's user avatar
5 votes
0 answers
233 views

What is known about the mode of the number of divisors $\le x$?

Let $d(x)$ be the divisor function. Let $M(x)$ ($x$ a positive integer) be the most frequent value of $d(y)$ for $1 \le y \le x$. Is an asymptotic known for $M(x)$, and failing that, can $M(x)$ at ...
user514014's user avatar
1 vote
1 answer
258 views

Sum of divisors of Stirling numbers of the second kind

In this post we denote the Stirling number of the second kind as ${n\brace k}$, I add as reference the article Stirling numbers of the second kind from the encyclopedia Wikipedia. And we denote the ...
user142929's user avatar
1 vote
0 answers
28 views

Asymptotic size for the number of terms not exceeding $n$ in the class $r$ for a classification of the type Erdös-Selfridge for square-free integers

It is possible to define a classification similar than the Erdös-Selfridge classification of primes for different sequences. Please ee [1], section A18 and the references cited in this book. Because ...
user142929's user avatar
1 vote
0 answers
101 views

Size of a set defined by divisor function

After some computations, I guessed the following conjecture. How can I prove or disprove it? thanks! Let $$ A(k)=\#\left\{\left(t,\frac{k+t+a}{4t-1}\right):1\leq t\leq k,\ 1\leq a\leq k+t,\ a\mid(k+...
asad's user avatar
  • 841