1. ## prime series......

I was just trying to solve the problem from a book by David M. Burton.

If any help in formulating a solution can be rendered, I shall be highly obliged.

thanks
kaka

2. To repeat what I put in your last post.

If you want people to take the time to solve your questions please make the effort to write out the question in full, and not just provide a download link.

Thankyou

3. Originally Posted by craig
To repeat what I put in your last post.

If you want people to take the time to solve your questions please make the effort to write out the question in full, and not just provide a download link.

Thankyou

I think providing a PDF file is fine; I, on the other hand, would never open an unknown .doc file...

Tonio

4. Originally Posted by kaka1988
Let $p_n$ denote the $n^{th}$ prime. For $n>3$, show that $p_n.
Prove this by induction. I'll leave the base case of $n=4$ to you.

Now suppose $p_n, then $p_n+p_n.

But Bertrand's Postulate tells us that $p_{n+1}<2p_n$.

So we get $p_{n+1}<2p_n, which proves the claim.

5. ## I apologise....

Actually I don't know how to use [tex] tags, that's why i had to use a .doc file to post my question.

Kindly guide me.

thanks kaka

6. Originally Posted by kaka1988
Actually I don't know how to use [tex] tags, that's why i had to use a .doc file to post my question.

Kindly guide me.

thanks kaka

Read "LaTeX Help" in the section "Math Resources"

Tonio