be22b008.tex

\section{BE22B008}
\large {Ramanujan-Hardy Asymptotic Function} 
\begin{equation}
    {\displaystyle p(n)\sim {\frac {1}{4n{\sqrt {3}}}}\exp \left({\pi {\sqrt {\frac {2n}{3}}}}\right)} 
\end{equation}
$p(n)$ denotes the partition function which represents the number of possible partitions of a non-negative integer $n$.
The above formula is a good approximation of $p(n)$ as $n$ gets bigger and bigger. \\

Name: Lokesh Parihar \\
Roll No: BE22B008 \\
GitHub ID: paradoxicasm \\

\footnote{Hardy, G. H.; Ramanujan, S. (1918), "Asymptotic formulae in combinatory analysis", Proceedings of the London Mathematical Society, Second Series, 17 (75–115). Reprinted in Collected papers of Srinivasa Ramanujan, Amer. Math. Soc. (2000), pp. 276–309.}