Home
Class 10
MATHS
Prove that n^(2)-n divisible by 2 for ev...

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

Text Solution

Verified by Experts

The correct Answer is:
2
Doubtnut Promotions Banner Mobile Dark
|

Topper's Solved these Questions

  • NUMBERS AND SEQUENCES

    PREMIERS PUBLISHERS|Exercise THINKING CORNER|13 Videos

  • NUMBERS AND SEQUENCES

    PREMIERS PUBLISHERS|Exercise PROGRESS CHECK|56 Videos

  • NUMBERS AND SEQUENCES

    PREMIERS PUBLISHERS|Exercise EXERCISE 2. 10|15 Videos

  • MENSURATION

    PREMIERS PUBLISHERS|Exercise OTHER IMPORTANT OBJECTIVE TYPE QUESTIONS|16 Videos

  • RELATIONS AND FUNCTION

    PREMIERS PUBLISHERS|Exercise OTHER IMPORTANT OBJECTIVE TYPE QUESTIONS|25 Videos

Similar Questions

Explore conceptually related problems

Prove that 3^(2n)-1 is divisible by 8.

Prove the 2^(n)+6times9^(n) is always divisible by 7 for any positive integer n.

Which among the following is the least number that will divide 7^(2n)-4^(2n) for every positive integer n? [4,7,11,33]

Prove that 3^(2n+2)-8n-9 is divisible by 8 for all n ge 1

Prove that (n !)^2 < n^n n! < (2n)! , for all positive integers n.

Using Binomial theorem, prove that 6^(n)-5n always leaves remainder 1 when divided by 25 for all positive integer n.

Using Binomial theorem ,prove that 6^(n)-5n always leaves remainder 1 when divided by 25 for all positive integer n.

Prove that 2.7^(n)+ 3.5^(n)-5 is divisible by 24 for all n in N

Show that 9^(n + 1) - 8n - 9 is divisible by 64, whenever n is a positive integer.

Using binomial theorem prove that 8^(n) - 7n always leaves remainder f when divided by 49 for all positive integer n.

Home
Profile