Same Remainder Every Time

If n n is a positive integer, what is the remainder when n × ( n + 1 ) × ( 2 n + 1 ) \large n \times (n+1) \times (2n+1) is divided by 6?

3 2 5 1 4 0

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Ossama Ismail
Feb 9, 2016

The sum of the first n squares, 1 2 + 2 2 + . . . + n 2 = n ( n + 1 ) ( 2 n + 1 ) / 6 1^2 + 2^2 + ... + n^2 = n(n + 1)(2n + 1) / 6 .

If n n and ( n + 1 ) (n + 1) are consecutive integers then exactly one of them will be even and divisible by 2. If neither n n nor ( n + 1 ) (n + 1) is divisible by 3 3 then ( n + 2 ) (n + 2) will be. Therefore n ( n + 1 ) ( 2 n + 1 ) n(n + 1)(2n + 1) is divisible by both 2 and 3.

7l momtaz :)

Refaat M. Sayed - 5 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...