For questions on the divisor sum function and its generalizations.

learn more… | top users | synonyms

2
votes
1answer
32 views

If $N = q^k n^2$ is an odd perfect number with Euler prime $q$, and $k=1$, does it follow that $\frac{\sigma(n^2)}{n^2} \geq 2 - \frac{5}{3q}$?

Let $\sigma=\sigma_{1}$ be the classical sum-of-divisors function. If $N = q^k n^2$ is an odd perfect number with Euler prime $q$ (i.e., $q$ satisfies $q \equiv k \equiv 1 \pmod 4$), and $k=1$, does ...
0
votes
0answers
28 views

Combining a working hypothesis for odd perfect numbers with an inequality for logarithms

Euler's theorem for odd perfect numbers states that if there exists and odd perfect number, that is an odd positive integer $n$ satisfying $\sigma(n)=2n$, where $\sigma(m)=\sum_{d\mid m}d$ denotes the ...
0
votes
0answers
17 views

Convergence for $\sum_{\text{m composite}}\frac{e^{2\pi\sigma(m)i/(m+1)}}{m^s}$, where $\sigma(n)$ is the sum of divisors function

Let $\sigma(n)=\sum_{d\mid n}d$ the sum of divisors function. When one writes informally the identity $$\sum_{n=1}^\infty \frac{e^{\frac{2\pi\sigma(n)i}{n+1}}}{n^s}=1+\mathcal{P}(s)+\sum_{\text{m ...
2
votes
1answer
33 views

How to find that a number is a sum of multiple of different numbers?

Suppose a product comes in packs of 3, and 5, and a customer demands 8 quantities of that ...
2
votes
0answers
44 views

If $L > 1$ is an odd almost perfect number with $\omega(L)=6$, then $L$ must be divisible by $3$.

Edited July 15 2016 Let $\mathbb{N}$ denote the set of positive integers. Let $\sigma = \sigma_{1}$ denote the (classical) sum-of-divisors function. Let $I(x) = \dfrac{\sigma(x)}{x}$ denote the ...
1
vote
0answers
18 views

Can I presume that this inequality is a good aproximation for a divisor function?

I've used the Lemma 7.9 from page 73 from Krizek, Luca and Somer, 17 Lectures on Fermat Numbers From Number Theory to Geometry Springer CMS (2001) (you can see this page as a Google Book, type here ...
1
vote
0answers
15 views

If $N \neq p^k$, $(\sigma(N) - N) \mid (N - 1)$, and $3 \mid (N - 1)$, does it follow that $\nu_{3}(\sigma(N) - N) \neq \nu_{3}(N - 1)$?

(Note: This has been cross-posted from MO.) The title says it all. Let $\sigma=\sigma_{1}$ be the classical sum-of-divisors function. Here is my question: Original Problem (Note: This has been ...
2
votes
0answers
43 views

Can an odd perfect number be divisible by either $2049$ or $2051$?

Can an odd perfect number be divisible by either $2049$ or $2051$? Note that $2049 = 3 \cdot {683}$, and that $2051 = 7 \cdot {293}$. Added July 15 2016 It is known that an odd perfect number ...
0
votes
2answers
75 views

Is there an interpretation for why $\sigma(x) = x \iff x = 1$, that is not (purely) number-theoretic?

The title says it all. Let $\sigma = \sigma_{1}$ denote the classical sum-of-divisors function. That is, $$\sigma(N) = \sum_{d \mid N}{d}.$$ For example, $\sigma(10) = 1 + 2 + 5 + 10 = 18$. Here is ...
1
vote
1answer
52 views

Number of divisors greater than a number [closed]

Given a number $x$, it is easy to count its total number of divisors by combinatorial method. Is there a way to efficiently determine the number of divisors of $x$ greater than a given number $y$?
3
votes
1answer
25 views

What is the complete (polynomial) factorization of $\sigma(p^k)$, where $p$ is prime with $p \equiv k \equiv 1 \pmod 4$?

The title says it all. What is the complete (polynomial) factorization of $\sigma(p^k)$, where $p$ is prime with $p \equiv k \equiv 1 \pmod 4$? Here, $\sigma = \sigma_{1}$ is the classical sum-...
1
vote
0answers
22 views

Can this heuristic about Sorli's conjecture and odd perfect numbers be made rigorous?

Let $N = q^k n^2$ be an odd perfect number with Euler prime $q$. That is, we have $q \equiv k \equiv 1 \pmod 4$. Sorli (page 89) conjectured that $k=1$ always holds. Suppose we rewrite $N$ as $$N = ...
1
vote
0answers
64 views

What are the mathematical consequences if $10$ is proved to be solitary?

Let $\sigma(x) = \sigma_{1}(x)$ denote the sum of the divisors of $x$, and let $$I(x) = \dfrac{\sigma(x)}{x}$$ be the abundancy index of $x$. For example, $$\sigma(10) = 1 + 2 + 5 + 10 = 18$$ so that ...
0
votes
0answers
15 views

Divisor Function over a Quadratic

The divisor function is defined as $\sigma_1(n)=\sigma(n)=\sum_{d\mid n}d$. Consider the divisor function over a quadratic $$f(x)=\sigma(a x^2+bx+c)$$ Where $a,b,c \in \mathbb{Z}$ (note we allow $a, b$...
4
votes
1answer
138 views

Project Euler's, Problem #565

Project Euler's, Problem #565 states: Let $\sigma(n)$ be the sum of the divisors of $n$. E.g. the divisors of $4$ are $1, 2$ and $4$, so $\sigma(4)=7$. The numbers $n$ not exceeding $20$ ...
1
vote
0answers
22 views

Justify $\lim_{n\to\infty}n^p\int_0^1\sum_{k=n}^\infty\frac{\sigma(k)e^{x/k}}{k^{p+2}\log\log k} dx=\frac{e^\gamma\int_0^1f(x)dx}{p}$

Inspired in PROBLEM 207, La Gaceta de la Real Sociedad Matemática Española, Vol. 16, N0. 3 (page 507 in spanish, proposed and solved by Furdui), I've tried write examples of this new statement ...
2
votes
1answer
32 views

Explaining an integral involving the divisor function

In a 1973 paper by Martinet, Deshouilliers and Cohen, $A(x)$ is defined as $$A(x)=\lim_{N\to\infty}\frac{\#\{n\leq N\mid \frac{\sigma(n)}{n}≥x \}}{N}$$ where $\sigma(n)$ is the "sum-of-divisors" ...
2
votes
0answers
19 views

Exploring congruences and identities involving Mersenne primes and the terms of Lucas-Lehmer test

When I was exploring congruences$\dagger$ involving the terms $S_k$ defined in Lucas-Lehmer test (this reference is the Wikipedia, but the main reference is Crandall and Pomerance, Prime Numbers: A ...
1
vote
1answer
54 views

Sum of divisors and indices: $\sigma (n)= 2^k$

Are there infinitely many positive integers (say $n$ is one of them), sum of whose divisors are powers of two, i.e, $ \sigma (n)= 2^k $ ?
2
votes
1answer
74 views

Explaining a Series Expansion for the Divisor Function

The "sum-of-divisors" function, defined as $\sigma(n)=\sum_{d\,\mid\,n}d$, can be expressed as $$\sigma(n)=\sum_{i=1}^n\sum_{j=1}^i\cos\Big(2\pi n \frac{j}{i}\Big)$$This expansion makes logical sense. ...
1
vote
3answers
53 views

Elementary number theory sum of divisors

Let the sum of the divisors of a number $N$ be equal to $s$(excluding N itself) then show that if $s=N$ then show that N is a perfect number. I tried to use the basic formula for sum of divisors but ...
2
votes
1answer
57 views

Does satisfy $f(n)=\frac{\sigma(n)}{n^2}$ the hypothesis of Halasz’s inequality?

Let $\sigma(n)=\sum_{d\mid n}d$ the sum of divisor function. I would like to know if I can write an example of some of the following Theorem 1 or Theorem 2 from $$f(n)=\frac{\sigma(n)}{n^2}$$ in Tao, ...
1
vote
2answers
65 views

If $b^2 \equiv 1 \pmod 3$, is it possible to have $\sigma(b^2) \equiv b^2 \pmod 3$?

The title says it all. Let $\sigma(N)$ denote the sum of the divisors of the positive integer $N$. To paraphrase my question: If $3 \mid \left(b^2 - 1\right)$, is it possible to have $3 \mid \...
2
votes
1answer
41 views

A question on the greatest common divisor of integers and their divisor sum

Suppose that $x, y, z$ are positive integers. Let $\sigma(x)$ be the sum of the divisors of $x$, and let $\gcd(y, z)$ be the greatest common divisor of $y$ and $z$. Here is my question: If the ...
1
vote
1answer
21 views

Can $\sigma(2^r)$ be abundant for $r > 1$?

Let $\sigma(x)$ be the sum of the divisors of the positive integer $x$. If $\sigma(y) < 2y$, $y$ is called deficient; if $\sigma(z) > 2z$, $z$ is called abundant. Questions (1) Can $\...
0
votes
0answers
24 views

Doubts and computations about Dirichlet series and aliquot sequences I

Perhaps the more easier statement that one can deduce for aliquot sequences (which is the Wikipedia's Page) is the following Lemma. For an integer $n\geq 1$, let $s^0(n)\equiv n$, $s(n)\equiv s^1(...
2
votes
2answers
88 views

Find all the natural numbers $n$ such that $\sigma(n)=15$

Find all the natural numbers $n$ such that $\sigma(n)=15$ Where $\sigma (n)$ is the sum-of-divisors function My attempt: $$n=p_1^{\alpha_1}\cdots p_s^{\alpha_s}$$ $$\sigma(n)=\frac{p_1^{\...
1
vote
3answers
71 views

What are the applications of Sigma Function?

I read about the Sigma Function today.It tells that- The $\sigma(n)$ is the sum of all the positive divisors of $n$. But I had no idea how they can be useful.What are the practical applications ...
0
votes
1answer
65 views

How do I make this formula for the primes more concise?

The form I made for the $(n+1)^{th}$ prime $p_{n+1}$ is $\displaystyle1+\sum_{j=1}^{2p_n-1}\lfloor\frac{p_n!^j}{j!}\rfloor-\lfloor\frac{p_n!^j-1}{j!}\rfloor=p_{n+1}.$ Problem is, just like any ...
1
vote
1answer
17 views

On the relationship between $\max(p_i)$ and $\omega(b)$, if $\sigma(b^2)/b^2$ is bounded above by a specific number $U$

Let $\omega(x)$ denote the number of distinct prime factors of $x$, and let $\sigma(x)$ be the sum of the divisors of $x$. Denote the abundancy index of $x$ by $I(x) = \sigma(x)/x$. Let the number $...
1
vote
1answer
19 views

Question about the validity of a proof involving the abundancy index

Let $\sigma(x)$ be the sum of divisors of $x$, and denote the abundancy index of $x$ by $I(x) = \sigma(x)/x$. Consider the number $y^2 \in \mathbb{N}$, and suppose that I know that $I(y^2) < 4/3$. ...
1
vote
1answer
23 views

If $\sigma(N)$ is odd, $N = 2y^2$, and $y$ is not a power of two, does it follow that $\gcd(2,y) = 1$?

Let $\sigma(N)$ denote the sum of the divisors of the number $N$. It is well-known that $$\sigma(N) \equiv 1 \pmod 2 \iff \left\{\{N = x^2\} \lor \{N = 2y^2\}\right\}.$$ Here is my question: If $...
7
votes
1answer
155 views

Why can this cosine sum function show all primes less than $N^2$?

I constructed this cosine sum that puts all primes within N on line y=1, and its zeros show the sieve by primes less than N. For $x<N^2$, they are all primes. $$ P(N,x)=\sum_{n=2}^{N}\frac{1}{n}\...
2
votes
1answer
62 views

Are primes less than the sum of divisors?

I am trying to prove that Let $p_n$ be the $n$th prime number, $\sigma (n)=\sum_{d|n}d$. Prove that $$\sigma(n) \le p_n$$ It seems obvious at first glance-to me, at least the sum of divisors of ...
0
votes
3answers
68 views

How many numbers less than 100 have the sum of factors as odd?

How many numbers less than 100 have the sum of factors as odd? Answer is 16 This question and explanation is taken from careerbless.com The link given derives the answer using some properties ...
3
votes
3answers
45 views

Proof that $\sum_{d|m} |\mu(d)|=2^n$, where $n$ is the number of distinct prime divisors of $m$?

Given an integer $m$ such that $n$ is denoting the distinct prime divisors of $m$, is there a proof that the sum over the divisors of m of the absolute value of the Möbius function $\mu(d)$ is equal ...
0
votes
0answers
46 views

How to generate the sequence of prime building blocks of the colossally abundant numbers: $2, 3, 2, 5, 2, 3, 7, 2, 11, 13, 2, 3, 5, 17, 19, 23, 2,…$

This is the sequence of prime numbers which are the elementary building blocks for the superior highly composite numbers: $2, 3, 2, 5, 2, 3, 7, 2, 11, 13, 2, 3, 5, 17, 19, 2, 23, 7, 29, 3, 31, 2, 37, ...
1
vote
1answer
27 views

Does “sum of divisors” function attain every value of the form $kn$?

By the "sum of divisors" function I mean the function $\sigma (n)= \sum_{d|n} d$. If we choose $k=1$ then it is not possible that we have $\sigma (n)=n$ because $n$ always has at least two divisors, ...
1
vote
1answer
28 views

On the Density of Deficient Odd Numbers and Abundant Integers

Let $\sigma(x)$ denote the sum of the divisors of $x$. If $\sigma(x) < 2x$, then $x$ is said to be deficient, while if $\sigma(x) > 2x$, $x$ is said to be abundant. (Of course, when $\sigma(x) ...
1
vote
0answers
16 views

On a criterion for almost perfect numbers using the abundancy index

Let $\sigma(x)$ denote the sum of the divisors of $x$, and let $I(x) = \sigma(x)/x$ be the abundancy index of $x$. A number $y$ is said to be almost perfect if $\sigma(y) = 2y - 1$. In a preprint ...
2
votes
0answers
30 views

A cubic relationship for perfect numbers

Combining the identity (the composition of the polynomial $P_3(x)=\frac{x(x+1)(2x+1)}{6}$ with the arithmetical function $N(n)=n$ and the known proof by induction) $$1^2+2^2+\ldots+n^2=\frac{n(n+1)(...
0
votes
0answers
21 views

On the density of solitary numbers

Let $\sigma(x)$ denote the sum of the divisors of $x$, and let $I(x) = \sigma(x)/x$ be the abundancy index of $x$. If $X$ is the unique solution of $$I(X) = \dfrac{a}{b}$$ (for a given rational ...
2
votes
1answer
21 views

Even perfect numbers and a relationship with polygonal numbers

Let $\sigma(m)=\sum_{d\mid m}d$ the sum of divisors function, for example $\sigma(6)=1+2+3+6=12$. Question. I don't know if this exercise was in the literature, and I believe that I know how ...
0
votes
0answers
16 views

Formula for calculating available quantities

This mathematics novice is having a difficult time with a seemingly easy problem. I'm trying to devise a formula for calculating available quantity for a Widget. Let's say a widget has 10 ...
4
votes
0answers
47 views

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

(Note: This question has been cross-posted to MO.) 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 ...
0
votes
1answer
44 views

Is the following inequality involving the sum-of-divisors and Euler totient functions true?

First Question Is the following inequality involving the sum-of-divisors $\sigma$ and Euler totient $\phi$ functions true? $$\frac{\sigma(N)}{N} \leq \frac{N}{\phi(N)}$$ Second Question When $...
1
vote
1answer
50 views

Has limit $\frac{\sigma_0(n)\sigma_2(n)}{(\sigma(n))^2H_n},$ where $H_n$ is the nth harmonic number?

By specialization of an inequality I can write $$2 \sum_{k=1}^{n-1} \frac{1}{d_{k}} \sum_{l=k+1}^{n} \frac{1}{d_{l}}\leq 2\frac{\sigma_0(n)-1}{\sigma_0(n)}\cdot \left( \frac{\sigma(n)}{n} \right)^2, $...
0
votes
1answer
38 views

Equation involving 'sigma of integer' function

Let $\sigma (n)$ be the sum of all positive divisors of $n\in\mathbb{N}$. Determine for which least $n$: $$\sigma (x) = n$$ has exactly two and exactly three solutions. The problem also asks for the ...
1
vote
1answer
16 views

What is wrong with this proof that $p_1 > \omega(x)$, where $p_1$ is the least prime dividing $x$?

Let $x \in \mathbb{N}$, and let $$x = \prod_{i=1}^{\omega(x)}{{p_i}^{\alpha_i}}$$ be the canonical factorization of $x$. (That is, the $p_i$'s are primes with $p_1 < \ldots < p_{\omega(x)}$.) ...
0
votes
1answer
34 views

A computational experiment about identities involving the sum of remainders function

Let $\sigma(m)$ the sum of divisors function and $$S(m)=\sum_{k=1}^m\text{m mod k}$$ the sum of remainders function, then it is know that for integers $m>1$ $$\sigma(m)+S(m)=S(m-1)+2m-1.$$ On the ...