"If n is an odd integer , then n is prime" = by giving a counter exmple prove that the given statement is not true .

If n is an odd integer then n ^(2) -1 is divisible by

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

By giving counter example , show that the following statements are not true : (I) In n is an odd integer, then n is prime. (ii) The equation x^(2) - 4 =0 does not a root lying between 0 and 3.

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

Counter example to "product of two odd integers is even" is

By giving a counter example,show that the following statement is false.If n is an odd integer,then n is prime.

Counter example to " 2n^2 +11 is a prime" is

By giving a counter example, show that the following statement is false. If n is an odd integer, then n is prime.

By giving a counter example, show that the following statement is false. If n is an odd integer, then n is prime.

By giving a counter example, show that the following statement is false. If n is an odd integer, then n is prime.