Formula for likely prime Numbers of the form $n!+1$ are quite often prime numbers. Is there any formula $f(n)$ such that the probability that $f(n)$ is prime approaches 1 as $n$ goes to infinity and $f(n)$ also approaches infinity?
If not, is there some formula better then $n!+1$ ?
Is there any formula $g(n)$ such that: the number of times $g(n)$ is prime for $0<n<M$, divided by $M$, does not approach 0 as $M\to\infty$?
 A: Numbers of the form $n!+1$ appear to be very seldom prime.  As of a few months ago, there were only $21$ known values of $n$ for which $n!+1$ is prime, with the largest known $n$ around $110000$.  It is not known whether there are more than $21$. So I would not agree that $n!+1$ is quite often a prime number. There are some details and a few references here. 
On the basis of the admittedly skimpy numerical evidence for $n!+1$, the simple function $f(n)=6n+1$ does far better at representing primes than $n!+1$.    
For spectacular performance at small values of $n$,  there is Euler's $f(n)=n^2-n+41$, which is prime for $n=1, 2, \dots, 40$. It also seems to be "often" prime afterwards.  However, it has not even been shown that there are infinitely many $n$ such that $n^2-n+41$ is prime!  
It might be difficult to give precise meaning to your question about whether there is a formula $g(n)$ such that $g(n)$ is prime for some "positive fraction" of the integers.  The difficulty is with the term "formula."  If we interpret "formula" broadly enough, there are even formulas for primes..  Most of these are, on analysis, somewhat artificial, and not at all helpful, but they are formulas.
However, things change if we are willing to allow exceptions. We can get quite natural and, most importantly, easily computable functions that generates mostly primes by minor tweaking of certain primality tests.  
For instance, we can use the fact that if $2^{n-1} -1$ is divisible by $n$, then $n$ is very likely to be prime.  (If $p$ is an odd prime, then $2^{p-1}-1$ is divisible by $p$. There are also non-primes $n$ such that $n$ divides $2^{n-1}-1$, but they are scarce compared to the primes.)  For information about such "almost" primality criteria, please look here. 
