Prove that n + n is divisible by 2 for a...

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

Verified by Experts

The correct Answer is:

2

REAL NUMBERS
ZEN PUBLICATION|Exercise ADDITIONAL QUESTIONS(SHORT ANSWER TYPE 2 QUESTIONS)|7 Videos
QUADRATIC EQUATIONS
ZEN PUBLICATION|Exercise ZEN ADDITIONAL QUESTIONS (IIT FOUNDATION)|5 Videos
SOME APPLICATIONS OF TRIGONOMETRY
ZEN PUBLICATION|Exercise ADDITIONAL QUESTIONS (VALUE BASED QUESTIONS )|2 Videos

Similar Questions

Explore conceptually related problems

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

n^7-n is divisible by 42 .

Show that one and only one out of n, n + 2 or n + 4 is divisible by 3, where n is any positive integer.

Prove that 3^(2n)+24n-1 is divisible by 32 .

n^2 -1 is divisible by 8, if n is

If p is a natural number, then prove that p^(n+1) + (p+1)^(2n-1) is divisible by p^(2) + p +1 for every positive integer n.

Prove that (n !) is divisible by (n !)^(n-1)!

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 interger.

State and prove Bionomial theorem for any positive integer n.