Set Theory and Logic


Refutation of the Bertrand Postulate and Bertrand-Chebyshev Theorem © Copyright 2018 by Colin James III All Rights Reserved.

Authors: Colin James III

[F]for every n > 1, there is always at least one prime p such that n < p < 2 n.(1.1) For all n∈N>0, there exists a prime number p with n<p≤2n.(2.1) Eqs. 1.2 and 2.2 as rendered are not tautologous, meaning both Bertrand expressions are suspicious.

Comments: 1 Page. © Copyright 2018 by Colin James III All rights reserved.

Download: PDF

Submission history

[v1] 2018-02-18 18:17:32

Unique-IP document downloads: 818 times 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. 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