Home
Class 11
MATHS
Prove by induction that n(n+1)(2n+1) is ...

Prove by induction that `n(n+1)(2n+1)` is divisible by 6 for all `ninNN`.

Promotional Banner

Similar Questions

Explore conceptually related problems

Prove by the principle of mathematical induction that n(n+1)(2n+1) is divisible by 6 for all n in N

Prove by the principle of mathematical induction that: n(n+1)(2n+1) is divisible by 6 for all n in Ndot

Use the Principle of Mathematical Induction to prove that n(n + 1) (2n + 1) is divisible by 6 for all n in N.

If x and are two real numbers, then prove by mathematical induction that (x^(n)-y^(n)) is divisible by (x-y) for all ninNN .

Prove by Principle of Mathematical Induction that (10^(2n -1) + 1) is divisible by 11 for all n in N .

By method of induction, prove that 5^(2n) - 1 id divisible by 6, for all n in N .

Prove by the principle of mathematical induction that for all n in N. (2^(3n)-1) is divisible by 7 for all n in N .

Prove by method of induction 15^(2n-1) + 1 is divisible by 16, for all n in N

Prove by the principle of mathematical induction that for all n in N. 3^(2n)+7 is divisible by 8 for all n in N .

Prove by the principle of mathematical induction that for all n in N. 5^(2n)-1 is divisible by 24 for all n in N .