To be pedantic, the question should say "for all n >= 2". A detailed proof is given here: http://mathforum.org/library/drmath/view/51527.html The proof is quite long, but it only uses properties of logarithms, exponents, and the binomial theorem, so if you know about these and have enough mental stamina, you can probably make sense of it.
what is the difference between 2x and 2n
it is 2n -n because in meiosis a diploid 2n becomes a haploid n.
haploid is n, diploid is 2n.
28
C(n)H(2n)
Prime if n=1, composite otherwise.
2 is a prime number. 2 times anything but 1 is composite.
make n one
A Mersenne prime has the form 2n-1. For 2n-1 to be prime, n must also be prime. Perfect numbers have the form 2n-1(2n-1) where 2n-1 is a Mersenne prime, so when a new Mersenne prime is discovered, another perfect number is also found.
what is the difference between 2x and 2n
2n is 2 times n.
Mersenne primes are mostly of interest as mathematical curios. A Mersenne prime has the form 2n-1. For 2n-1 to be prime, n must also be prime. Perfect numbers have the form 2n-1(2n-1) where 2n-1 is a Mersenne prime, so when a new Mersenne prime is discovered, another perfect number is also found.
it is 2n -n because in meiosis a diploid 2n becomes a haploid n.
2n can be split into 2 n's so: n+n then add one to one of the n's and subtract one from one of the n's n+1+n-1 ^two consecutive odd integers^
Meiosis produces haploid gametes which have the ' n ' symbol.
A Mersenne number is a number of the form 2n-1. When this number is prime, it is known as a Mersenne prime.A Mersenne prime has the form 2n-1. For 2n-1 to be prime, n must also be prime. Examples are the Mersenne prime 7 (23 - 1 = 7) and the Mersenne prime 127 (27 - 1 = 127)
Let n = smallest of the odd numbers, then let n+2 = the larger of the two numbers (Remember, 1 is not a prime number.) n+ n+2 = {(2)(7)}2 2n +2 = 142 2n = 196 -2 2n = 194 n = 97 n + 2 = 99