A very crude version of the heuristic probabilistic argument (for the strong form of the Goldbach conjecture) is as follows. The prime number theorem asserts that an integer "m" selected at random has roughly a formula_5 chance of being prime. Thus if "n" is a large even integer and "m" is a number between 3 and "n"/2, then one might expect the probability of "m" and "n" − "m" simultaneously being prime to be formula_6. If one pursues this heuristic, one might expect the total number of ways to write a large even integer "n" as the sum of two odd primes to be roughly