Displaying all pairs ( p , q ) that satisfy lemoine ' s ▁ conjecture ▁ for ▁ the ▁ number ▁ ' n '
for ( it = pr . begin ( ) ; it != pr . end ( ) ; ++ it ) cout << n << " ▁ = ▁ " << it -> first << " ▁ + ▁ ( 2 ▁ * ▁ " << it -> second << " ) STRNEWLINE " ; }