Sum of Sums over Primes that Divide the Index

In summary, the conversation discusses a problem involving sums over primes, where the sum is taken over all primes that divide the outside index. The question is whether there is a way to manipulate this sum and the suggestion is to use the floor function.
  • #1
drewfstr314
20
0
I have seen double sums, but have come across a problem involving sums over primes. However, this sum is inside a second sum, and is taken over all primes that divide the outside index, like this:

[itex] \sum_{k=1}^{n} \sum_{p | k} \frac 1p [/itex]

for p prime.

Is there any way to manipulate this? Any help would be appreciated.

Thanks!
 
Mathematics news on Phys.org
  • #2
I think that's equivalent to [itex] \sum_{p=2}^{n} \frac{\left \lfloor n/p \right \rfloor}{p} [/itex], where the square brackets represent the floor function, and p runs through the primes less than or equal to n.

I don't know if that helps at all, and no doubt it can be simplified more so.
 

Related to Sum of Sums over Primes that Divide the Index

What is the "Sum of Sums over Primes that Divide the Index"?

The "Sum of Sums over Primes that Divide the Index" is a mathematical function that calculates the sum of all numbers that are divisible by a prime number and less than or equal to the given number. For example, the "Sum of Sums over Primes that Divide the Index" of 10 would be 2+3+5+7 = 17.

How is the "Sum of Sums over Primes that Divide the Index" calculated?

The "Sum of Sums over Primes that Divide the Index" is calculated by finding all the prime numbers that divide the given number and adding them together. This can be done using a mathematical formula or by using a computer program.

What is the significance of the "Sum of Sums over Primes that Divide the Index" in mathematics?

The "Sum of Sums over Primes that Divide the Index" has many applications in number theory, cryptography, and computer science. It is also used in various algorithms and mathematical proofs.

Is there a limit to the input number for the "Sum of Sums over Primes that Divide the Index"?

No, there is no limit to the input number for the "Sum of Sums over Primes that Divide the Index". However, as the input number increases, the calculation may become more complex and time-consuming.

Can the "Sum of Sums over Primes that Divide the Index" be negative?

No, the "Sum of Sums over Primes that Divide the Index" cannot be negative as it is the sum of positive numbers. If the input number is negative, the result will also be negative.

Similar threads

Replies
7
Views
1K
Replies
2
Views
421
Replies
1
Views
793
  • Precalculus Mathematics Homework Help
Replies
17
Views
2K
Replies
4
Views
583
Replies
2
Views
1K
Replies
8
Views
2K
Replies
6
Views
1K
  • General Math
Replies
5
Views
979
  • Precalculus Mathematics Homework Help
Replies
9
Views
1K
Back
Top