Optimal Symmetric Bounds on P

Various bounds on p, such as Bertrand’s Postulate and Legendre’s Conjecture, propose regions around n that have at at I least one prime within them. Using Prime Generator Theory, show more precise symmetric bounds on p, such that for n a prime exists symmetrically within a distance of n1/2 below and above it. That is to say, a prime exists for: n – n1/2 < p < n and n < p < n + n1/2