Home
Class 9
MATHS
Find counter examples to disprove the st...

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

Text Solution

Verified by Experts

The correct Answer is:
For `n =11, 2n^(2) + 11 = 253` which is not a prime number.
Promotional Banner

Topper's Solved these Questions

  • PROOFS IN MATHEMATICS

    NCERT TELUGU|Exercise EXERCISE - 15.3|6 Videos

  • PROBABILITY

    NCERT TELUGU|Exercise EXERCISE 14.1|21 Videos

  • QUADRILATERALS

    NCERT TELUGU|Exercise EXERCISE|80 Videos

Similar Questions

Explore conceptually related problems

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

Find counter examples to disprove the statements: A quadrilateral with all sides are equal in a square.

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.

Find counter examples to disprove the statements: Two triangle are congruent if all their corresponding angles are equal.

Find counter examples to disprove the following statements: For any integers x and y, sqrt(x^(2) + y^(2)) = x+y

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

Give one example each to the following statements. ii. A whole number which is not a natural number

Find the whole number if n +4 = 9

If the mean of first n natural numbers is 11 then n =