For questions on the divisor sum function and its generalizations.

learn more… | top users | synonyms

2
votes
0answers
15 views

The number of divisors of a number whose sum of divisors is a perfect square

Let $n$ denote a non-prime whose sum of divisors is a perfect square. I have noticed a few surprising facts on the number of divisors of $n$: It is either prime or semi-prime or $27$ in all cases ...
3
votes
1answer
43 views

What proportion of the positive integers satisfy this number-theoretic inequality?

Let $\sigma(x)$ be the sum of the divisors of the positive integer $x$, and let the abundancy index of $x$ be defined as $$I(x) = \frac{\sigma(x)}{x}.$$ My question is this: What proportion of the ...
0
votes
1answer
33 views

John and Gary are playing a game. John spins a spinner numbered with integers from 1 to 20.

John and Gary are playing a game. John spins a spinner numbered with integers from 1 to 20. Gary then writes a list of all of the positive factors of the number spun except for the number itself. Gary ...
3
votes
1answer
57 views

A simple lemma on divisors…

Let $D$ be a strictly positive divisor defined on a compact Riemann Surface such that $\operatorname{dim} \mathfrak{L}(D)=1+\operatorname{deg} D$. There exists a point $p \in X$ such that ...
2
votes
1answer
48 views

Improving the inequality $x\sigma_1(x) \leq \sigma_1(x^2)$ for $x \in \mathbb{N}$

Let $\mathbb{N}$ be the set of positive integers. For $x \in \mathbb{N}$, $\sigma_1(x)$ gives the sum of the divisors of $x$. (For example, $\sigma_1(3) = 1 + 3 = 4$.) We call the ratio $I(x) = ...
1
vote
1answer
34 views

Prove no odd number can be abundant.

A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of $28$ would be $1 + 2 + 4 + 7 + 14 = 28$, which ...
2
votes
1answer
25 views

How to calculate $\sigma(x^k)$?

If $n = 2^k$, then $\sigma(n) = 2 \times 2^k - 1$, For example: $$\sigma(28) = \sigma(2^2) \times \sigma(7) = 7 \times 8 = 56$$ But how about: $$\sigma(100) = \sigma(2^2) \times \sigma(5^2) = 7 ...
1
vote
1answer
21 views

Question on Sum of Divisor?

I know $\sigma(m)=24$ for $m=\{14,15,23\}$ but how can we find this numbers? Here is what I did Let the prime factorization of $m$ be $$m=p_1 ^{\alpha _{1}}p_2 ^{\alpha _{2}}\cdot\cdot\cdot p_k ...
1
vote
1answer
33 views

Determine if $\sum_{q=1}^{\lceil n/2\rceil}R_q(n)$ gives the number of divisors of $n$.

Let $$R_q(n)=\left\{\begin{array}{lll} r\left(\dfrac n{2q-1}\right)&\text{if }(2q-1)\mid n\\ 0&\text{otherwise}\end{array}\right\},$$ where $r(n)$ is the ruler function, i.e., the $2$-adic ...
1
vote
0answers
32 views

Prove a property of the divisor function (Part 2)

Further to this MSE question, I would like to pose a follow-up inquiry: If $n \in \mathbb{N}$ and $(\sigma(n) - n) \mid (n - 1)$, does it follow that $n$ and $\sigma(n)$ would have to be coprime, so ...
3
votes
0answers
103 views

Divisor summatory function for squares plus one

As an exercise for my Analytic Number Theory course, I need to prove, using Dirichlet hyperbola method, that: $\sum_{n\leq x}\tau(n² + 1)= {3\over\pi}x\log(x) + O( x)$, where $\tau(n)=\sum_{d|n}1$ ...
2
votes
1answer
186 views

Proof regarding Robin's inequality (RI).

Let $\sigma$ be the divisor sum function, $\gamma$ the Euler-Mascheroni constant and $n>5040$. Robin showed that if the inequality$$\displaystyle \sigma(n)<e^{\gamma}n\log\log n$$ ever fails, it ...
0
votes
1answer
31 views

Function $f(n) = 2^{\omega(n)}\mu^2(n)$

Let $$f(n) = 2^{\omega(n)}\mu^2(n)$$, where $\omega(n)$ is number of distinct prime divisors of $n$ and $\mu(n)$ is Moebius function. I want to simplify it. As long as $$ ...
0
votes
1answer
36 views

About the sigma function and an interesting inequality. [closed]

Is it true $\sigma(A)$/$\sigma(B)$ > = (A/B) ; given B divides A ?
2
votes
0answers
92 views

Whats wrong in this proof of $10$ is a solitary number?

Friendly numbers are two or more natural numbers with a common abundancy, the ratio between the sum of divisors of a number and the number itself. Two numbers with the same abundancy form a friendly ...
1
vote
1answer
22 views

how to sum the divisors of N mod K if all I have is N mod K?

The input to this problem is N. I have to calculate 2 things: 1 - N! mod (10^9 + 7) 2 - sum of all divisors of N! mod (10^9 + 7) I know how to do the first step, I'm wondering if there is a way ...
1
vote
2answers
72 views

About the 'sigma' function.

Is it true that if $n$ divides $m$ , $\sigma(\frac mn) \leq \frac{\sigma(m)}n$. If so this has a bearing on counterexamples to Robin's inequality.
0
votes
0answers
22 views

Sum of convolution of divisor function [duplicate]

For every integer $k$ let $d_k: \mathbb{N} \rightarrow \mathbb{C}$ be defined recursively as $d_0 = \mathbf{1}$, $d_k = d_{k-1} * \mathbf{1}$. So for example $d_1 (n) = d (n) = \sum_{d \vert n} 1$ is ...
0
votes
1answer
41 views

Why is this Moebius equivalence true?

I would like to know why the following is true: $$\tau(n^2) = \sum_{d | n} \mu(n/d)(\tau(d))^2$$ I cannot derive it. It is on OEIS but I'd like to know how this was found. $\tau(n)$ is the count of ...
1
vote
0answers
42 views

Number of divisiors of $n$ less than $m$

I'm looking for a closed- or alternative-form of the function that counts the number of divisors of an integer $n$ that are less than some integer $m$ (interested in $m < n$, obviously): $ ...
0
votes
1answer
86 views

Who should I ask for Robin's paper? At any rate, I want to find out if a similar result to his can be achieved with 36 instead of 12.

Robin proved unconditionally that for $\ n \ge 3$ , $$ \sigma(n)<\left(e^\gamma+{\log\log12\left({\frac73}-e^\gamma \log\log12\right)\over (\log \log n)^2}\right)n \log \log n. $$ I need a similar ...
0
votes
0answers
52 views

If Lagarias' inequality is wrong, are there infinitely many counterexamples to it?

I do know that since Robin's (RI) and Lagarias' (LI) inequalities are both equivalent to RH, they're also equivalent one another, hence if RI is false, so is LI. And Robin proved there are infinitely ...
0
votes
0answers
24 views

Could you give a definition of what is a superior highly composite number using only words?

I know very well what is a superior highly composite number, but I would like to see how could we (roughly) define what is a superior highly composite number using only words (using no equations and ...
0
votes
0answers
57 views

With odd $\ n>9, \sigma(n) < {11\over 16} e^{\gamma} n \log \log n $?

If that's not the case, do we know anyway some upper bound better than that given by Robin's inequality, since it has been shown that it holds for all odd numbers > 9 ( Choie, YoungJu, et al. "On ...
1
vote
0answers
82 views

Find a closed form for the constant term

In a previous question, an asymptotic expansion was provided for the weighted divisor summatory function $\displaystyle \frac {d(n)}{n}$: $$\sum_{n\leq ...
0
votes
1answer
50 views

Why are multiples of abundant numbers also abundant numbers?

I am currently working on Project Euler Problem 23 which involves abundant numbers. In short, abundant numbers are numbers that are less than the sum of their proper divisors. For example, 12 has ...
0
votes
0answers
44 views

What are the patterns in the number of divisors $d(n)$ of the highly composite numbers?

I am trying to understand the patterns in the number of divisors $d(n)$ of the highly composite numbers. The numbers marked with an asterisk are the superior highly composite numbers. The first ...
0
votes
0answers
57 views

Given an integer n find smallest integer i such that σ(i)=n. Smallest Inverse Sum of Divisors

Hi All I need some help I am trying to solve this problem which involves computation of sum of divisors and its inverse. In other words Given an integer n find smallest integer i such that σ(i)=n ...
3
votes
2answers
65 views

Infinite series involving sum of divisors function

Is there much known about infinite series of the form $\sum_{n=1}^{\infty}\frac{\sigma_{1}(n)}{n}q^{n}$ where $\sigma_{1}(n)$ is the sum of divisors function. I am particularly interested in ...
1
vote
1answer
81 views

the average order of divisor function

In Analytic number theory by Apostol there's a theorem: $$\sum_{n\le x} \sigma(n)= \frac{1}{2} \zeta(2)x^2 + O(x\log x)$$ and then it claims that because we know that $\zeta (2)= \frac{\pi^2}{6} $ ...
1
vote
1answer
36 views

Prove that for any $n$ having at least two distinct prime factors, there exists a perfect square between $n$ and $\sigma(n)$

I came up with a new problem, described as follows: Prove that for any $n$ having at least two distinct prime factors, there exists at least one perfect square between $n$ and $\sigma(n)$ I will post ...
1
vote
0answers
35 views

Can we prove this inequality in another way?

As explained here, I've managed to prove the following inequality: $\sigma(n)\geq\sqrt n(d(n)-2)+n+1$. This can be proved easily in two cases (one for $n$ being a perfect square and one for otherwise) ...
4
votes
1answer
268 views

Is there a closed form expression for the sum of all the proper divisors of an integer?

I have already found a summation formula here: http://math.stackexchange.com/a/22723, and also a very interesting recursive formula here: http://math.stackexchange.com/a/22744. Any ideas on how to ...
0
votes
1answer
42 views

What are the smallest numbers $n$ such that $\dfrac{d(n)}{\ln(n)} \geq k$ where $d(n) = \sigma_0(n)$ is the number-of-divisors function?

I have calculated $\dfrac{d(n)}{\ln(n)}$ on a few highly composite numbers up to 5040. Here is what I got: $\dfrac{d(120)}{\ln(120)} = 3.3420423$ $\dfrac{d(360)}{\ln(360)} = 4.0773999$ ...
1
vote
1answer
47 views

Prove that $\dfrac{\sigma_1(n)}{n} = \sigma_{-1}(n)$ where $\sigma_x(n)$ is the sum of the $x$th powers of the positive divisors of $n$.

I computed $\dfrac{\sigma_1(n)}{n}$ and $\sigma_{-1}(n)$ on a good hundred values of $n$, and they seem to always match. For example: $\dfrac{\sigma_1(6)}{6} = \dfrac{1 + 2 + 3 + 6}{6} = ...
0
votes
1answer
44 views

A generalization of perfect numbers

In analogy to perfect numbers, let's say I wanted a set $S = \{s_1, s_2,..., s_n\}$ of numbers with the property: $$\frac{s_1+s_2+\cdots s_n}{n}= \sigma(S) := \sum_{d\mid s_1\wedge d\mid s_2, d\mid ...
3
votes
1answer
89 views

Holomorphic Differentials on a non-singular curve.

So I've been working on this for an exam I have coming up and I'm not sure I really understand. If I have a curve defined by some homogenous polynomial P, I can show that the canonical divisor class ...
0
votes
1answer
162 views

Why does the number of divisors of a superior highly composite number is always a highly composite number up to 720720 ? (the only exception is 120)

I've calculated the number of divisors of every superior highly composite number up to $10^{27}$: The number of divisors of a superior highly composite number is always a highly composite number up ...
1
vote
1answer
215 views

Why isn't $1$ a superior highly composite number?

A superior highly composite number is a positive integer $n$ for which there is an $\epsilon>0$ such that $\dfrac{d(n)}{n^\epsilon} \geq \dfrac{d(k)}{k^\epsilon}$ for all $k>1$, where the ...
1
vote
2answers
29 views

How to show $\sum_{n\leq x}d(n)=\sum_{ab\leq x}1$?

How to show this equation below is true. $$\sum_{n\leq x}d(n)=\sum_{ab\leq x}1$$ $d(n)$ is the divisior function. It seems easy but i just can't see it.
1
vote
1answer
57 views

How to prove $D(n)<2n(\log\log n)$?

How to prove $D(n)<2n(\log\log{n})$ for all sufficiently large $n$ where $D(n)$ is the Divisor summatory function.
0
votes
0answers
109 views

Among the superior highly composite numbers, which are the most divisor dense numbers?

I’m searching for the most divisor dense natural numbers. Firstly we have the highly composite numbers: 1, 2, 4, 6, 12, 24, 36, 48, 60, 120, 180, 240, 360, 720, 840, 1260, 1680, 2520, 5040, … But ...
3
votes
0answers
42 views

When is $f(n)=\sum\limits_{d\mid n}\sigma(d)$ prime?

When is $f(n)=\sum\limits_{d\mid n}\sigma(d)$ prime? Note, $f$ is multiplicative and $\sigma(n)>1, \;n>1$. Therefore $f(n)$ is prime only when $n=p^\alpha$, with $p$ prime, $\alpha\geq1$. ...
4
votes
1answer
59 views

How prove this $\sum_{t|n}(d(t))^3=\left(\sum_{t|n}d(t)\right)^2$

show that $$\sum_{t|n}(d(t))^3=\left(\sum_{t|n}d(t)\right)^2$$ where $d(n)$ is the number of positive divisors of $n$. see this have simaler $$1^3+2^3+\cdots+n^3=\left(1+2+\cdots+n\right)^2$$ maybe ...
4
votes
1answer
95 views

How can I prove that $\frac{\sigma(n)}{n} = \sum_{(d|n)} \frac{1}{d}$ for every $n \in \mathbb{Z^{+}}$?

I want to show that $\displaystyle \frac{\sigma(n)}{n} = \sum_{(d|n)} \frac{1}{d}$ for every $n \in \mathbb{Z^{+}}$. This is essentially a basic number theory question. I am able to get to the ...
3
votes
1answer
60 views

Explanation for a theorem pertaining on Dirichlet character sums

A very well known theorem pertaining on Dirichlet characters sums states that if $\chi$ is a Dirichlet character modulo $k$, defining $$ A\left(n\right)=\sum_{d\mid n}\chi\left(d\right) $$ Then ...
2
votes
3answers
218 views

How to find the sum of $k$th powers of all proper divisors of first $n$ numbers

I am trying this problem but unable to come up with efficient algorithm can someone help with this problem. I have solved the easier version of the problem below is the problem link. Thanks in ...
0
votes
1answer
20 views

Is $N$ considered a proper divisor of $N$

I just started Project Euler and I have run into an issue. There are numerous problems that ask about the proper divisors, sum of proper divisors, etc. of a number $N$. Now, before I proceed, I would ...
3
votes
1answer
77 views

Prove a property of the divisor function

Let $q$ be an odd composite integer and $\sigma(q)$ the sum of the positive divisors of $q$. For what $q$ is it true that $$(\sigma(q)-q) \mid (q-1) \;?$$ If $q$ is prime, it is clear that it is ...
7
votes
0answers
115 views

Proving that $\sigma_7(n) = \sigma_3(n) + 120 \sum_{m=1}^{n-1} \sigma_3(m)\sigma_3(n-m)$ without using modular forms?

This problem appears as a (starred!) exercise in D. Zagier's notes on modular forms. I have to admit that I have no idea how to do it. Here, $\sigma_k(n) =\sum_{d\mid n} d^k$, as usual. This ...