The $k^{th}$ prime is greater than $k(\ln k + \ln\ln k-1)$ for $k\geq 2$, Mathematics of Computation, vol.68, issue.225, pp.411-415, 1999. ,
DOI : 10.1090/S0025-5718-99-01037-6
On constructing codes from planar nearrings, 2011. ,
Near-rings1. The theory and its applications, of North-Holland Mathematics Studies, 1983. ,
On polynomial near-ring codes, Contributions to general algebra, pp.233-238, 1991. ,
Near-rings: what they are and what they are good for, 2011. ,
DOI : 10.1090/conm/009/655977
Estimation de la fonction de Tchebychef ? sur le k-ième nombre premier et grandes valeurs de la fonction ?(n) nombre de diviseurs premiers de n, Acta Arith, vol.42, issue.4, pp.367-389, 1983. ,
Approximate formulas for some functions of prime numbers, Illinois J. Math, vol.6, pp.64-94, 1962. ,