Home
Class 12
MATHS
If n is an odd integer, prove that n^(2)...

If n is an odd integer, prove that `n^(2)` is also an odd integer.

Promotional Banner

Topper's Solved these Questions

  • REAL NUMBERS

    CHHAYA PUBLICATION|Exercise Exercise (Short Answer Type Questions)|11 Videos

  • REAL NUMBERS

    CHHAYA PUBLICATION|Exercise Exercise (Long Answer Type Questions)|10 Videos

  • REAL NUMBERS

    CHHAYA PUBLICATION|Exercise Exercise (Multiple Choice Questions)|8 Videos

  • RANDOM VARIABLE AND ITS DISTRIBUTION

    CHHAYA PUBLICATION|Exercise Assertion Reason Type|8 Videos

  • RELATION AND MAPPING

    CHHAYA PUBLICATION|Exercise Assertion Type|2 Videos

Similar Questions

Explore conceptually related problems

If x and y are odd integers, then xy is also an odd integer r examine its truth value.

If n is an odd integer, Prove that 16 is a divisor of n^4 + 4n^2 + 11 .

Using contrapositive method show tha the compund statement .is true or not. If x and y are odd integers,'then xy is also a odd integer.

Examine the validity of the follwing compound statements : If a and b are integers such that ab is an odd integer , then both a and b are odd integers .

If nge4 is an integer,prove by induction that n^(2)ltn! .

If nge3 is an integer prove that 2n+1 lt 2^n by P.M.I.

Write the converse of each of the following conditional statements : If n is an odd integer , then n is a prime integer .

If n be an odd negative integer, then prove that (x + 1) is a polynomial of degree (x^(n)+1) .

Show that ((sinA+sinB)/(cosA+cosB))^(n) + ((cosA-cosB)/(sinA-sinB))^(n) = 2 "tan"^(n) (A+B)/2 when n is an even integer, 0, when n is an odd integer.

Prove that 2^(n) gt n for all positive integers n.