Home
Class 10
MATHS
" Q5.Prove that "n^(2)-n" is divisible b...

" Q5.Prove that "n^(2)-n" is divisible by "2" for every positive integer'n'? "

Promotional Banner

Similar Questions

Explore conceptually related problems

Prove that n^(2)-n divisible by 2 for every positive integer n.

Prove that n^(2)-n divisible by 2 for every positive integer n.

Prove that n^2-n divisible by 2 for every positive integer n.

Prove that n + n is divisible by 2 for any positive integer n.

Prove that 5^(2n)-6n+8 is divisible by 9 for all possible integers n.

Using binomial theorem, prove that 50^(n)-49n-1 is divisible by 49^(2) for all positive integers n.

Using binomial theorem, prove that 5^(4n)+52n-1 is divisible by 676 for all positive integers n.

Using binomial theorem, prove that 5^(4n)+52n-1 is divisible by 676 for all positive integers n.

Show that n^2-1 is divisible by 8, if n is an odd positive integer.

Show that n^(2)-1 is divisible by 8, if n is an odd positive integer.