SOLUTION: find a counterexample that shows the statement is false. n, 2 to the power of n > n+1

SOLUTION: find a counterexample that shows the statement is false. n, 2 to the power of n > n+1

Algebra.Com

Question 436836: find a counterexample that shows the statement is false.
n, 2 to the power of n > n+1
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!

If n = 1, this is like saying , a false statement.
RELATED QUESTIONS
Find a counterexample that shows the statement is false. For every number n, 2^n>n... (answered by HyperBrain)

Find a counterexample for statement. 2^n+3^n is divisible by 4 the key n = 3 (answered by Alan3354)

Identify the correct proof by induction or a counterexample to disprove the following... (answered by ikleyn,Edwin McCravy)

"If n is not even then then (n-7) is not prime." A value of n that shows this statement... (answered by math_helper,ankor@dixie-net.com)

Identify the correct proof by induction or a counterexample to disprove the following... (answered by Fombitz)

I need to find a counterexample to the statement 4^n+1 is divisible by 5. Can someone... (answered by Edwin McCravy)

For all integers a,b,and c, if a = b then a/c = b/c. Provide a counterexample that shows (answered by Edwin McCravy)