Find a counterexample to the statement 4^n+1 is divisible by 5.?

Question

show work please

Answer 1

i would go with my method but i also agree with every one above too they did there best to answer your question

16 + 1 is not divisible by 5

I mean to say 4^(n + 1)

a counterexample would be n=3 - n=1+3=4

then i would write down this

4^4=256 256 is not divisible by 5.

if you don't get it then write this down

(2^4+1 = 17) PRIME #

Answer 2

Well if n is restricted to integers, and we mean divisible to mean division with no remainder,   then the easiest is example is n = 2

2^4+1 = 17 (a prime number!)

Answer 3

If you mean (4^n) + 1, then a counterexample is n =2

16 + 1 is not divisible by 5

--------------------------------------...

If you mean 4^(n + 1) then a counterexample is n = 3.  

n = 1 + 3 = 4

4^4 = 256

256 is not divisible by 5.

Answer 4

n=(1/2)