Show that 2^2n-1 +1 is divisible by 3 for all n > 1.

The proof makes use of congruences as follows:

Step-by-step explanation:

We can prove this result using congruences module 3. First of all we shall show that

for all . By induction we have

Then induction we proved that for all . Then

From here we conclude that the expression is divisible by 3.

00

step-by-step explanation:

c.

step-by-step explanation:

because first you have to add the 4x, 9x, and the 7x together and you get 20x and then you add the last numbers up and you get 5and then you put the subtraction sign in there and that's how you get the answer.