Home
Class 12
MATHS
Find one counter example to disprove for...

Find one counter example to disprove for the statement is "If `n` is a whole number then `2n^2 + 11` is a prime"

Promotional Banner

Similar Questions

Explore conceptually related problems

Find counter examples to disprove the statements: If n is a whole number, then 2n^2+11 is a prime.

Find counter examples to disprove the following statements: If n is a whole number then 2n^(2) + 11 is a prime .

Find counter examples to disprove the following statements: If n is a whole number then 2n^(2) + 11 is a prime .

Find counter examples to disprove the following statements: If n is a whole number then 2n^(2) + 11 is a prime .

Find counter examples to disprove the following statements: Every rectangle is a square.

Find counter examples to disprove the following statements: Every rectangle is a square.

Find counter examples to disprove the following statements: Every rectangle is a square.

Find counter examples to disprove the following statements: Every rectangle is a square.

Find counter examples to disprove the following statements: Every rectangle is a square.

Write the contrapositive of the statement : "If n is a prime number, then n is even".