The mathematic note book associated with the paper. On primes and prime-containing intervals using the partition function p(n). You can increase the limit to desired value for evaluation of teh results of the paper

We introduce and investigate a new conjecture that relates the integer partition function p(n) and the nearest prime to p(n). Based on extensive computational evidence for very large n (partition values with thousands of digits), we formulate the Hannan–Jassim Conjecture. We provide sample data, describe the computations, and discuss possibilities for the results of this conjecture being true. for further details see paper "On primes and prime-containing intervals using the partition function p(n)"