Sequence of Primes: Concluding Divergence for All e>0

  • Thread starter Thread starter Dragonfall
  • Start date Start date
  • Tags Tags
    Primes Sequence
Dragonfall
Messages
1,023
Reaction score
5
From the fact that \sum_{\mathbb{P}}\frac{1}{p} diverges, how do I conclude that the sequence \frac{n^{1+e}}{p_n} diverges for all e>0?

(p=prime, P_n=nth prime)
 
Physics news on Phys.org
What have you tried so far? A hint- try proving this by contradiction.
 
Suppose it converges, then since \sum\frac{1}{n^{1+e}} converges for any e>0, \sum_P\frac{1}{p} must converge as well, which is impossible.
 
You might want to give a little more info on why the divergence of the first sum implies the divergence of the second, presumably you're using one of the standard methods of relating the two sums, but which?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top