My Math Forum  

Go Back   My Math Forum > College Math Forum > Number Theory

Number Theory Number Theory Math Forum


Thanks Tree1Thanks
  • 1 Post By Country Boy
Reply
 
LinkBack Thread Tools Display Modes
May 13th, 2015, 06:21 PM   #1
Member
 
Joined: Apr 2015
From: india

Posts: 83
Thanks: 0

Math Focus: pi,prime numbers,random function
A simple proof of the prime-counting function

through my prime number theory prime counting function could be very easily could be proved
you can see the prime counting function details on
Prime-counting function - Wikipedia, the free encyclopedia

PROOF:

as we know that $\displaystyle P_n=hn+b$
now during group change n and b will becomes equal(not exactly).so the above equation could becomes
$\displaystyle P_l^h\simeq n_h^&infin(h+1)$
where $\displaystyle P_l^h$ denotes last prime of a group h. now our main aim is to convert this it into logarithmic form this could be done using the great vedic conjecture.
The Great Vedic conjecture says that fibonacci and prime sequence are connected. i had found that
$\displaystyle b_{h}^&infin\simeq F_{h+2}^{2}$
also
$\displaystyle F_{h+2}^{2}= e^h$
then putting this equations into first equation we get
$\displaystyle ln(P_l^h)\simeq h+ln(h+1)$
now multyplying by n we get a the form of prime
$\displaystyle n*ln(p_l^h)\simeq nh+n*ln(h+1)=P_l^h$
also it is of the form of nh+b , then upto group 2 it will produce an accurate result because ln(2)<1
then the above equation could be writtern as
$\displaystyle n=P_n/over ln(p_n)$
this also proves Gauss and legendre's conjecture

for more information on my theory you can check this on my website.
Solving the Prime Numbers

prime numbers could be very very easily solved.
Rahul k is offline  
 
May 14th, 2015, 06:10 AM   #2
Math Team
 
Joined: Jan 2015
From: Alabama

Posts: 3,264
Thanks: 902

It would help if you would tell us what you are trying to prove!

That is, what are you trying to prove about the "prime counting function"?

And what does "solve prime numbers" mean?

You "prove" theorems or statements, not a function, such as the prime counting function, or a set, such as the set of prime numbers. You prove statements about them. What are you trying to prove about the prime numbers?
Thanks from CRGreathouse
Country Boy is offline  
Reply

  My Math Forum > College Math Forum > Number Theory

Tags
counting, function, prime, primecounting, proof, simple



Thread Tools
Display Modes


Similar Threads
Thread Thread Starter Forum Replies Last Post
A property of the prime counting function. Jonas Castillo T Number Theory 6 May 9th, 2015 06:26 PM
An equation of prime counting function. jim198810 Number Theory 6 March 26th, 2015 07:31 PM
Question on prime counting function \pi fafa Number Theory 24 June 22nd, 2013 12:55 AM
Mertens function and prime counting function Bogauss Number Theory 22 October 17th, 2012 01:27 PM
Lower Bound for the Prime Counting Function guynamedluis Number Theory 2 April 21st, 2012 12:48 PM





Copyright © 2019 My Math Forum. All rights reserved.