A Heuristic and Approximate Solution to the Oppermann’s Conjecture

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.