# If n is a nonnegative integer, must 2^2n + 1 be prime? Prove or give a counterexample?

### Answer this question

• If n is a nonnegative integer, must 2^2n + 1 be prime? Prove or give a counterexample?

MATH CSE20 Homework 5 Due Monday ... Counterexample: 3 x 2 = 6. (4) Prove the ... (n 1). For this to be a prime, we must choose n so that one factor ...
Positive: 38 %
... theorem used in the discussion of Mersenne primes. ... integer n, 2 n-1 is prime, ... x n-1, for the latter to be prime the former must be ...
Positive: 35 %

### More resources

Mathematical induction Example: Prove n < 2n for ... written as a product of primes. Assume P(n): an integer n can be ... •an+1 = an 2 + (2n + 1), ...
Positive: 38 %
DeMorgan’s Law should have been used to give n|xy−x OR n6 |x implies n|y−1 ... every integer (including n) must ... prime. Prove that if p = a2 +1 ...
Positive: 33 %
On integers of the forms and ... term k of which and any nonnegative integer n, ... the same largest prime factor. We give an application to the ...