00:01
Hello everyone, in this question we have to use case based on congruence modulo or basic properties of congruence modulo in order to prove n cube is congruent to n mod 3.
00:15
So, first let us write the question n cube equal to n mod 3.
00:22
So, this n cube this n come to other side.
00:27
So, n cube minus n is congruent 0 mod this n cube minus n further can be written as n into n square minus 1 congruent 0 mod 3.
00:50
So, this n square n, n square minus 1 can be written as n plus 1 n minus 1 i have used a square minus b square formula.
01:01
So, i am written in the order that is n minus 1 n n plus 1 0 mod 3.
01:14
So, we have end up with this.
01:16
So, if you see this, this is nothing but the product of 3 consecutive integers...