SOLUTION: Let n be a positive integer, k the number of prime numbers less than or equal to n, and {{{p[k]}}} the greatest prime number less than or equal to n. Prove that {{{1/p[1]+1/p[2

Question 1027346: Let n be a positive integer, k the number of prime numbers less than or equal to n, and the greatest prime number less than or equal to n. Prove that
+...+,
where , , , ...,, and are the k prime numbers less than or equal to n.
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
Is that even true?

For example, if n = 10, then we have

which is a false statement.
RELATED QUESTIONS
For a positive integer $n$, $\phi(n)$ denotes the number of positive integers less than... (answered by ikleyn,math_tutor2020)

write the greatest prime number less than or equal to the... (answered by amarjeeth123)

It is a fact that if an N is a composite number, then there exists a prime p is less... (answered by fractalier)

Let n be a positive integer and 0, t<0, FX(t)=⌊t⌋, 0≤t (answered by ikleyn)
Let n be a positive integer and 0, t<0, FX(t)=t/n , 0≤t (answered by ikleyn)
Prove or disprove the following: The expression n2 � n +41 produces a prime number for... (answered by richard1234)
let k be an integer and p is a prime such that the quadratic equation x^2+kx+p=0 has two... (answered by ankor@dixie-net.com)
(a) Let p be a prime number greater than 3. What are the possible remainders of p upon... (answered by jim_thompson5910)
For every real number k, let ⌊k⌋ represent the "floor function", i.e.,... (answered by Edwin McCravy)