Can you prove that if #p_k# is prime number, then #sum_(k=1)^np_k^-1# is not an integer, for any #ninNN#?

Can you prove that if #p_k# is prime number, then #sum_(k=1)^np_k^-1# is not an integer, for any #ninNN#?

Can you prove that if #p_k# is prime number, then #sum_(k=1)^np_k^-1# is not an integer, for any #ninNN#?

1 Answer
Write your answer here...
Start with a one sentence answer
Then teach the underlying concepts
Don't copy without citing sources
preview
?

Answer

Write a one sentence answer...

Answer:

Explanation

Explain in detail...

Explanation:

I want someone to double check my answer

Describe your changes (optional) 200

1
Dec 11, 2017

Answer:

See below.

Explanation:

#sum_(k=1)^n 1/p_k = (sum_(k=1)^n 1/p_k prod_(j=1)^n p_j)/(prod_(j=1)^n p_j) = m# or

# (sum_(k=1)^n 1/p_k prod_(j=1)^n p_j) = m prod_(j=1)^n p_j#

then #(sum_(k=1)^n 1/p_k prod_(j=1)^n p_j) # should be divisible by #p_k, k = 1,2,cdots,n# which is an absurd because #1/p_k prod_(j=1)^n p_j# is not divisible by #p_k#

Was this helpful? Let the contributor know!
1500
Trending questions
Impact of this question
19 views around the world
You can reuse this answer
Creative Commons License