Ivan Shishkin, Rye (1878)

Problems/Real analysisUnreviewed

Divergence of ∑1p\sum \frac{1}{p}

by mathman·translated by visitor·
30
Difficulty scaleÉchelle de difficulté

This score reflects both the level of the required concepts and the difficulty of the solution.Ce score tient compte à la fois du niveau des notions nécessaires et de la difficulté de la résolution.

  1. 1–10First steps / middle schoolPremiers pas / collège
  2. 11–25Beginner / high schoolDébutant / lycée
  3. 26–50Intermediate / undergraduateIntermédiaire / licence
  4. 51–70Advanced / graduateAvancé / master
  5. 71–90Expert / specializedExpert / spécialisé
  6. 91–100Research levelNiveau recherche
These levels are approximate guides.Ces niveaux sont des repères approximatifs.
·
English
EnglishFrançais
This translation may be outdated. Its source text has changed since revision 3888.
Unreviewed. This problem has not been reviewed by trusted users yet.

Show that the sum
∑p⩽n1p,\sum_{p \leqslant n} \frac{1}{p},where pp runs over the primes, diverges.

I solved itMark it doneAdd to my listKeep it in your list

Hints

1

Hint 1

Open this only if you want a small nudge before looking at the solutions.

Available in Français; this hint has not been translated into the current language yet.

Solutions

1
Reveal solutionsAre you sure? Give it a try first.

Solution by mathmanFR

Discussions0 useful votes

∑p≤n1p>∑p≤nln(1+1p)=∑p≤n(ln(1−1p2)−ln(1−1p))>−ln(ζ(2))+ln(∑k=1n1k)>−ln(ζ(2))+ln(ln(n))\sum_{p\leq n}\frac{1}{p}> \sum_{p\leq n}ln(1+\frac{1}{p})=\sum_{p\leq n}(ln(1-\frac{1}{p²})-ln(1-\frac{1}{p}))> -ln(\zeta(2))+ ln(\sum_{k=1}^{n}\frac{1}{k})>-ln(\zeta(2))+ ln(ln(n))

Report

For an unclear, ambiguous, or possibly incorrect statement, please use the Discussion tab on the right. Report content that needs moderator intervention, such as dangerous, clearly non-mathematical, or plagiarized content.