Skip to main content

All Questions

Filter by
Sorted by
Tagged with
6 votes
2 answers
685 views

Number of divisors which are at most $n$

I’m interested in the function $\tau_n:\mathbb{N}\to\{1,2,3,\cdots, n\}$ defined by $$\tau_n(x)=\sum_{k=1}^n \mathbf{1}_{k\mid x},$$ the number of divisors of $x$ which are at most $n$. Question 6 of ...
1 vote
1 answer
153 views

Number of distinct near-squares primes dividing an odd perfect number

I'm curious about if the following question is in the literature or what work can be done about it. Denote the number of distinct primes dividing an odd perfect number $N$ with the arithmetic function ...
5 votes
1 answer
264 views

Analogue of the second Hardy-Littlewood conjecture for numbers of divisors?

Let $f(n)$ denote the proposition "There exists some $k>1$ such that $$ \sum_{m=k}^{k+n-1}\tau(m) < \sum_{m=1}^n\tau(m) $$ where $\tau(m)$ is the number of the divisors of $m$." (This ...
0 votes
0 answers
138 views

A diophantine equation involving partial sums of exponentials similar than the equation in Fermat's Last Theorem

I'm curious about the following diophantine equation from my invention: I don't know if this is in the literature, I wrote it using creativity in an attempt to write a variant of the equation in ...
13 votes
2 answers
2k views

Has it been proved that odd perfect numbers cannot be triangular?

(Note: This question has been cross-posted from MSE.) Euclid and Euler proved that every even perfect number is of the form $m = \frac{{M_p}\left(M_p + 1\right)}{2}$ where $M_p = 2^p - 1$ is a prime ...
8 votes
0 answers
346 views

A generalization of Feit–Thompson conjecture, for square-free integers

I asked the following question with my account that I have for these sites Mathematics Stack Exchange and MathOverflow. The bounty that I offered in MSE expired without answers. The post that I refer ...
0 votes
1 answer
224 views

Counting multiples in short intervals

Has anyone seen a problem like this in the literature? There are likely more generalized versions in sieve theory, which I am willing to tackle, but I would prefer a more elementary approach if ...
3 votes
1 answer
309 views

How to estimate the sum $\sum_{n\le x} \frac{n}{\tau(n)}$?

Let $\tau(n)$ be the number of positive divisors of $n\in \mathbb{N}$. Is it possible to get some good estimate for the sum $\sum_{n\le x} \frac{n}{\tau(n)}$? I know that the sum is $\mathcal O(x^2)$...
1 vote
0 answers
57 views

On divisibility conditions implying local coprimality conditions

This question is inspired by Bernardo Recaman's question Strings of consecutive integers divisible by 1, 2, 3, ..., N on intervals of $n$ integers being divisible by the integers $1$ through $n$. The ...
0 votes
0 answers
759 views

On sets of coprime integers in intervals

Briefly, Question: Is it "good enough" to use least prime factor in choosing a maximal set of coprime integers in an interval? The post title comes from a 1993 paper of Erdos and Sarkozy. They ...
2 votes
1 answer
515 views

On comparing two almost injective divisor maps

Edit 2018.08.08 This answer https://mathoverflow.net/a/307881 will be updated to give recent information about S, especially a forthcoming preprint. End Edit 2018.08.08 In an introductory post on ...
7 votes
1 answer
675 views

Short divisor sum

Let $d(n)$ denote the number of positive divisors of the positive integer $n$. Pick some positive $X,h \in \mathbb{R}$ and consider the sum $$ S(X,h) := \sum_{X \leq n \leq X+ h} d(n).$$ In view of ...
5 votes
0 answers
772 views

The Grimm Machine(s): A Collatz Conjecture Rival?

Edit 2018.08.08 This answer https://mathoverflow.net/a/307881 will be updated to give recent information about S, especially a forthcoming preprint. End Edit 2018.08.08 Just as the Collatz ...
0 votes
0 answers
98 views

Eigenvalues of a sequence of matrices involving the divisor function

Let $A_{n,k},k=1,\ldots,n$ be a sequence of $n\times n$ upper triangular matrices where $A_{n,1}=I_n$ and $A_{n,k},\quad 2\leq k\leq n$ be a regularly shifted and scaled matrix, with $P_{n,k}$ an $n\...
6 votes
1 answer
360 views

Friable Numbers In Short Intervals: Density Estimates?

I am hoping for explicit numerical estimates like the following sample (with made up numbers, though it might be true): for every $n \gt 10^6$ and every $b$ with $b^2 \lt n \lt b^3$, the number of ...
0 votes
1 answer
101 views

Any results on $\gcd(N^2, D(N^2))$ where $N^2$ is deficient and $D(N^2)$ is the deficiency of $N^2$?

Any results on $\gcd(N^2, D(N^2))$ where $N^2$ is deficient and $$D(N^2)=2N^2 - \sigma(N^2)$$ is the deficiency of $N^2$? I checked OEIS sequence A033879 and have so far been able to get hold of ...
5 votes
1 answer
232 views

Improvement of a bound on divisor distributions from "Divisors" (Hall and Tenenbaum)?

In the classic text referred to in the title of this question, the bound $$ H(x,y,2y) \ll \frac{x}{(\log y)^{\delta}\sqrt{\log \log y}},\quad (3\leq y\leq \sqrt{x}) $$ is given, where $\delta=1-\frac{...
9 votes
2 answers
1k views

runs of consecutive non squarefree integers

This question gained no attention at Math SE. Call a sequence of $k$ consecutive naturals squary if each one of them is divided by a square > 1. The Chinese Remainder theorem trivially guarantees us ...
4 votes
0 answers
413 views

Maximal order of Hooley's Delta function?

There is a large literature on Hooley's $$ \Delta(n)=\max_u\sum_{d|n,\ e^u\le d< e^{u+1}}1 $$ giving its normal and average order. What is known of its maximal order? Clearly $\Delta(n)\le d(n)$ ...
5 votes
1 answer
605 views

Who is attributed with the conjecture that every multiply-perfect number greater than $1$ is even?

I know that Descartes is considered to be the first to ask whether or not odd perfect numbers exist ($n$ such that $\sigma(n)=2n$, where $\sigma(n)$ is the sum of divisors of $n$), and he also ...