Show that, for any integer n > 2, (n + 1)" - 1 is divisible by n2. (hint: use the binomial theorem.)

It's true

Step-by-step explanation:

Operating the square we have:

Here we can factorize n:

The last line means our number () is divisible by n.

The clause of n>2 is true, but even its true for because when n=1 the theorem means that the expression is divisible by 1, but this it's true for every integer, and for n=0 the expression will be 0 and 0 it´s divisible by 0 (Following the definition a|b if a=nb, with a, b and n integers).

the mistake in the pattern is that :

b. the decimal point was moved one too many place values each time

the correct pattern could be made by :

b. moving the decimal point to the right the same numbers of place values as the exponents

the k side

step-by-step explanation:

plese mark mde brainliest!