Questions tagged [divisor-sum]

For questions on the divisor sum function and its generalizations.

In mathematics, and specifically in number theory, a divisor function is an arithmetic function that returns the number of distinct positive integer divisors of a positive integer.

Definition: The divisor function is the sum of positive integers dividing $n$, i.e., $$\sigma(n)=\sum\limits_{d\mid n} d~.$$ As usual, the notation "$d \mid n$ " as the range for a sum or product means that $~d~$ ranges over the positive divisors of $~n~$.

Often a related, more general function $$\sigma_a(n)=\sum\limits_{d\mid n} d^a$$ is studied. Both these functions are multiplicative.

The number of divisors function is given by $$\tau(n)=\sum\limits_{d\mid n} ~1$$

For example, the positive divisors of $~15~$ are $~1,~ 3,~ 5,~$ and $~15~$. So $$\sigma (15)=1+3+5+15=24\qquad \text{and}\qquad \tau(15)=4~.$$

References:

https://en.wikipedia.org/wiki/Divisor_function http://mathworld.wolfram.com/DivisorFunction.html http://sites.millersville.edu/bikenaga/number-theory/divisor-functions/divisor-functions.html

838 questions
4
votes
1 answer

sum of divisors for given range of numbers from 1 to n

we are given a function F(n) for a number n which is defined as sum of the divisors of n (including 1 and n) ... now given an integer N we have to calculate G(n) = F(1) + F(2) + F(3) + ..... + F(n)... is there any formula for it??? i saw "Peter…
3
votes
0 answers

Estimate of sum of divisors up to a certain number?

Let's define $\sigma(n,k) = \sum_{d|n,d\leq k} d$. Notice $\sigma(n,n)=\sigma(n)$, the standard sum of divisor function. It's a standard exercise to show that $$ \sigma(n) \leq n (\ln n + 1) $$ for some constant $c$. Is there any known result on…
Chao Xu
  • 5,768
2
votes
0 answers

How to divide total price into sum of multiple of numbers

How to divide total price into sum of multiple of numbers so that the sum is close to price as much as possible. Is there any formula? Example: Price: 1256.7 Numbers: 5.7, 3.6, 4.9, 10.1, 12.3, 6.8 Sulution should look like: 1256.7 = 5x5.7 + 30x3.6…
2
votes
0 answers

greater divior polynomials

Let $n,m$ be positive integers and $d = \gcd(n,m). $ Prove that $\gcd(x^{n} -1 ,x^{m} -1) = x^{d} -1$. Is this correct? Bezout : integers $r,s$: $\quad r(x^{n} -1) + s(x^{m} -1) = rx^{n} +sx^{m} - (r+s) = x^{d} -1$
andre
  • 21
2
votes
0 answers

Is there a similar relation to Robin's Inequality for the number of divisors ( $\sigma_0(n) $), instead of the sum of divisors (( $\sigma_1(n) $)

Robin's Inequality states: $\sigma(n)\lt e^\gamma n\log\log n $ for any n>5040. Is there an equivalent for $\sigma_0(n) $?
2
votes
1 answer

Ratio of the average of the divisor function $\sigma_k(n)$ for even / odd n

Question: Is there anything known (for example a proof) about the ratio $\frac{\bar{\sigma_k}(even)}{\bar{\sigma_k}(odd)}$ where $\bar{\sigma_k}$ is the average value which the divisor function returns? Numerically I get the (for me astonishing)…
2
votes
0 answers

Calculating divisors for generative music sequence

please bear with me as I'm not a mathematician but seeking something quite specific for use in determining sequences for creating generative rhythms in music (I can read & understand music). What I want is probably actually quite basic but I'm not…
2
votes
1 answer

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 \times x$$ I couldn't figure out how to calculate…
1
vote
0 answers

Can the sum of odd divisors of an integer exceed n

I know that the sum of divisors of an integer n can exceed it (abundant numbers) but can this occur when only considering odd divisors of n? Can the sum of all integers j : j|n, 2∤j be greater than n? If not how is it proven, and if so what is an…
dean
  • 11
1
vote
0 answers

Help Understanding A Statement by D.H.J. POLYMATH

Question: D.H.J. POLYMATH wrote in the paper Deterministic Methods To Find Primes the following statement: "$\ldots$ the key observation is that the parity of the prime counting function $\pi(x)$ is closely connected to the divisor sum function,…
Anthony
  • 3,738
1
vote
1 answer

Is the aliquot sum of an odd number always odd?

I am thinking yes. Here's my reasoning: Let $s(x)$ be the aliquot sum of $x$. If $p$ is prime then $s(px) = s(x) + ps(x) + x$ Base Case: if $x$ is an odd prime, then $s(x) = 1$ Assume it is true up to $x$ so that $s(x)$ is odd. Inductive Case: …
Larry Freeman
  • 10,433
1
vote
2 answers

Sum of divisors of a square

I was wondering if there is a nice formula for the number of divisors $d$ of a perfect square ($n^2$), such that $\frac{n}{2}
1
vote
2 answers

find all positive integers n with $\sigma(n)=12$

How do you find all positive integers n with $\sigma(n)=12$? $\sigma(n)$ is the sum of the divisors of $n$. The book gives the answer: Each factor in the formula for $\sigma(n)$ must divide $12$. The only way to get factors, other than $1$, of $12$…
WinstonCherf
  • 1,022
0
votes
1 answer

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 proper divisors 1,2,3,4,6. The sum 1+2+3+4+6=16 > 12,…
Xoque55
  • 4,384
0
votes
1 answer

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 like to make sure my vocabulary is correct. Is…
Milo
  • 347
1
2