A function for generating prime numbers as per sequence

May 30th, 2019 by Aziz Lokhandwala

Abstract: From the modular expressions for approximating π given by S.Ramanujan, I found my own function which can give prime numbers as per sequence but not as per xth order, so please don't mix up this with my one of the theory of "Making an approximations for nth index using Prime number Theorem".

The function can be given as: $$f(x) = {e^{{x^{1\over 2}}}} + 1 + {|ln|(ln...xtimes)|}$$'x' belongs to N U {0}

Deviations are possible with values after square of numbers, for example numbers after 4 ,9, 16, 25,... and numbers after above squares are: 5,10, 17,... But excluding above values of 'x', you can have prime numbers sequence in continuation.

If anyone can find a proof for this, he/she will be awarded with a great prize amount.

Comment or post your answer by tagging me(@upple1) onto your post, or you can mail me at perkanulla@gmail.com