# Prove that discrete math the following statement (if true) or provide a counterexample (if false): For all n \geq 4, 2^n - 1 is not a prime number.

Prove that discrete math the following statement (if true) or provide a counterexample (if false): For all $n\ge 4,{2}^{n}-1$ is not a prime number.
You can still ask an expert for help

## Want to know more about Discrete math?

• Questions are typically answered in as fast as 30 minutes

Solve your problem for the price of one coffee

• Math expert for every subject
• Pay only if we can solve it

Caren

Counter example
n=5 Then ${2}^{n}-1={2}^{5}-1=31$
31 is a prime. So statement is false for n=5. As $5\ge 4$.