We will need to approxi- mate the number of vertices in P GN2 in order to develop graph search algorithms for very large N . Using the Prime Number Theorem, the approximate number of vertices, |V |, in a P GN2 graph is: |V | ∼ 2N ln (2N ) ∼ 2N N (3) Equation 3 ...