This heuristic argument is actually somewhat inaccurate, because it assumes that the events of "m" and "n" − "m" being prime are statistically independent of each other. For instance, if "m" is odd, then "n" − "m" is also odd, and if "m" is even, then "n" − "m" is even, a non-trivial relation because, besides the number 2, only odd numbers can be prime. Similarly, if "n" is divisible by 3, and "m" was already a prime distinct from 3, then "n" − "m" would also be coprime to 3 and thus be slightly more likely to be prime than a general number. Pursuing this type of analysis more carefully, Hardy and Littlewood in 1923 conjectured (as part of their famous "Hardy–Littlewood prime tuple conjecture") that for any fixed "c" ≥ 2, the number of representations of a large integer "n" as the sum of "c" primes formula_8 with formula_9 should be asymptotically equal to