Number Theory

   

Demonstration of the Conjecture Meissel-Lehmer

Authors: Guilhem Cicolella

les deux seules puissances consécutives étant 8 et 9 le problème consistait à démontrer que la quantité de nombres premiers inférieure à 1 milliard de nombres(50847534)était démontrable algébriquement aussi vite qu'un ordinateur et donc de résoudre la conjecture de Meissel-Lehmer datant de 1870.

Comments: 2 Pages. [Corrections made by viXra Admin to confirm with the requirements on the Replacement Form - Please refrain from making further replacement]]

Download: PDF

Submission history

[v1] 2017-01-13 09:00:42 (removed)
[v2] 2020-01-04 08:13:30 (removed)
[v3] 2020-03-05 08:41:39 (removed)
[v4] 2020-03-26 08:21:44 (removed)
[v5] 2020-04-09 14:40:03 (removed)
[v6] 2020-04-14 07:47:38 (removed)
[v7] 2020-04-20 14:35:03 (removed)
[v8] 2020-04-24 07:09:54 (removed)
[v9] 2020-06-06 04:35:44 (removed)
[vA] 2020-12-05 08:40:58

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