Number Theory

    

A Method to Prove a Prime Number Between 3N and 4N

Authors: Wing K. Yu

In this paper, we will prove that when an integer n ˃1, there exists a prime number between 3n and 4n. This is another step in the expansion of the Bertrand’s postulate - Chebyshev’s theorem after the proof of a prime number between 2n and 3n.

Comments: 5 Pages.

Download: PDF

Submission history

[v1] 2022-03-15 10:23:51
[v2] 2022-05-31 20:40:43

Unique-IP document downloads: 252 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