Undergrad Question about the Divisor Function/Sums and Project Euler

Click For Summary
The discussion revolves around the application of the Divisor Function, specifically how to set it equal to algebraic functions and solve for solutions. The original poster seeks to understand this concept beyond programming, aiming to solve it by hand. It is noted that number theory typically fixes x as an integer while varying n, whereas varying x while keeping n fixed shifts the focus to real analysis. The conversation highlights the complexity of finding solutions using elementary functions and suggests exploring analytic number theory for deeper insights. The importance of understanding specific cases, such as perfect numbers and the conditions under which certain equations hold, is also emphasized.
Delta31415
Messages
90
Reaction score
8
So I am kind of lost... I don't really know how to ask this.
Project Euler is a website that hosts multiple programming contests and I am interested in this problem
https://projecteuler.net/problem=608
but my question isn't truly about this problem but a more solution.

I know that the Divisor Function is
{\displaystyle \sigma _{x}(n)=\sum _{d\mid n}d^{x}\,\!}
my question is can I set the Divisor function equal to an algebraic function of value x and solve for the solutions
for example:

{\displaystyle \sigma _{x}(n)=\sum _{d\mid n}d^{x}\,\!} = (x^2+7)\ or\ (x+9)\ or\ even\ ln(x)
p.s I know that I can do this using programming and I have but I would like to be able to do it by hand as well.
I have recently been reading some elementary number theory textbooks but all they do is talk about primes and things such as the division algorithm, the divisor function isn't even mentioned.

Thanks for the help and I am sorry for being so confusing.
Edit: finally fixed the Latex
 
Last edited:
Mathematics news on Phys.org
Number theory seems to be concerned with keeping x a fixed integer and varying n. Varying x while keeping n fixed is more a real analysis question. Even for
something as simple as \sigma_x(2) = ax + b you won't be able to get an answer using elementary functions for most values of a and b.. You could look up the lambert W function
https://en.wikipedia.org/wiki/Lambert_W_function#Solutions_of_equations (see example 1)
 
  • Like
Likes Delta31415
willem2 said:
Number theory seems to be concerned with keeping x a fixed integer and varying n. Varying x while keeping n fixed is more a real analysis question. Even for
something as simple as \sigma_x(2) = ax + b you won't be able to get an answer using elementary functions for most values of a and b.. You could look up the lambert W function
https://en.wikipedia.org/wiki/Lambert_W_function#Solutions_of_equations (see example 1)

so I have been reading the wrong textbooks and should look into analytic number theory and real analysis and thxs for the link

Edit: I have looked at the link and most of it involves exponentials, so my question should I try to convert the divisor function into an integral or is this even possible
 
I just noticed a big mistake that I made and I cannot edit it now >_>

The X in the divisor function should be 1 as I am finding the sum of proper divisors and the algebraic variable should be n instead of x as x has a value of 1 in this case
{\displaystyle \sigma _{1}(n)=\sum _{d\mid n}d^{1}\,\!} = an+b

which would make it a more of a number theory question
 
Delta31415 said:
{\displaystyle \sigma _{1}(n)=\sum _{d\mid n}d^{1}\,\!} = an+b

which would make it a more of a number theory question
Yes. If a =2 and b=0 these are the perfect numbers. If a>2 and b is 0, mutltiperfect numbers.
You probably need a different procedure for all different values of a and b. For example σ(n) = n+1 is valid if n is prime, σ(n) = n+2 is impossible, etc.
It's unknown wether there are odd perfect numbers, and for even perfect numbers you need to find mersenne primes. Techniques to find these or prove them impossible would probably apply for other values of a and b.
 
  • Like
Likes Delta31415
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 80 ·
3
Replies
80
Views
10K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 0 ·
Replies
0
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K