Number Theory

    

A Different Way to Prove a Prime Number Between 2N and 3N

Authors: Wing K. Yu

In this paper we will use a different way to prove that there exists at least a prime number p in between 2n and 3n where n is a positive integer. The proof extends the Bertrand’s postulate - Chebyshev’s theorem which states that a prime number exists between n and 2n. The method to prove this proposition is to analyze the binomial coefficient, a similar method used by Erdős in the proof of Bertrand’s postulate.

Comments: 5 Pages.

Download: PDF

Submission history

[v1] 2022-02-23 19:26:30
[v2] 2022-05-31 20:33:22

Unique-IP document downloads: 306 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus