Number Theory

    

A Heuristic and Approximate Solution to the Oppermann’s Conjecture

Authors: Salman Mahmud

Here we have shown a heuristic and approximate solution to the unsolved oppermann’s conjecture. Firstly we have generated a formula to calculate the approximate number of multiples of a prime number ���� less than or equal to a number �� which are not the multiples of the prime numbers ��1, ��2, ��3, … , ����−1 and ���� < ��. Then we have generated another formula to calculate the number of prime numbers less than or equal to a number �� if the prime numbers less than √�� are given where √�� ≤ �� ≤ �� . By using these formulas and the main concept of these formulas we have presented our solution.

Comments: 8 Pages.

Download: PDF

Submission history

[v1] 2021-05-21 11:47:07

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