If $B = \{x : x \in \mathbb{Z} \text{ and } x^2 < 16\}$, then $n(B)$ is (a) 3 (b) 4 (c) 6 (d) 7

> > [!TLDR] > List the integers satisfying $x^2 > $x^2 …

If B = \x : x ∈ mathbbZ and x² < 16\, then n(B) is – Class 11 Mathematics

Question of 132

B = \{x : x \in \mathbb{Z} \text{ and } x^2 < 16\}

(a) 3

(b) 4

(d) 7

Nagaland NbseNagaland Board of School Education (Class XI) 2024MCQ· 1mImportance★★★★★

0% · 0/132 Questions

🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Concept understanding — Set Membership

Set Membership

The idea in plain words

Every set is defined by exactly one question: "does this object belong to the set, or not?" That yes/no relationship between an object and a set is called membership. If an object is in the set, it is a member (or element) of the set; if it isn't, it simply is not.

A set is only "well-defined" if this question always has a clear answer for every possible object — that's what makes membership testable.

The notation

For a set $A$ and an object $x$ :

$x \in A$ reads " $x$ belongs to $A$ " or " $x$ is an element of $A$ " — TRUE membership.
$x \notin A$ reads " $x$ does not belong to $A$ " — FALSE membership.

Example. Let $A = \{2, 4, 6, 8\}$ .

4 \in A \qquad \text{(4 is listed inside A)}

5 \notin A \qquad \text{(5 is not listed inside A)}

Testing membership: roster form vs. set-builder form

Roster form — just look for the object in the list.

B = \{1, 3, 5, 7\}, \quad 3 \in B, \quad 4 \notin B

Set-builder form — plug the candidate into the defining rule and check if it's satisfied.

C = \{x \mid x \text{ is a prime number less than } 10\}

Is $7 \in C$ ? Check: is 7 prime and less than 10? Yes → $7 \in C$ .

Is $9 \in C$ ? Check: 9 is less than 10 but not prime ( $9 = 3 \times 3$ ) → $9 \notin C$ .

Properties every student must know

Each element is either in or out — never "partly in." Membership is binary, not a matter of degree.
Repetition doesn't affect membership. $\{1, 1, 2\} = \{1, 2\}$ — asking "is 1 a member?" gives the same YES either way.
Order never affects membership. $2 \in \{1, 2, 3\}$ is exactly the same fact as $2 \in \{3, 2, 1\}$ .
Nothing belongs to the empty set. For any $x$ , $x \notin \emptyset$ — there is nothing inside to belong to.
A set can be an element of another set. If $D = \{1, \{2, 3\}\}$ , then $1 \in D$ is true, and $\{2,3\} \in D$ is true, but $2 \in D$ is false — 2 is not directly listed in $D$ ; it is only inside the set that is listed.

A common slip

Students often confuse $x \in A$ (membership: is the object present?) with $B \subseteq A$ (subset: is every element of $B$ also in $A$ ?). The two symbols compare different kinds of things:

$\in$ / $\notin$ compares an element to a set.
$\subseteq$ / $\not\subseteq$ compares a set to a set. …

Why this formula?

Let's break down the definition of a set — not as a formula to memorise, but as a fundamental idea that underpins all of mathematics.

1. What is a Set? (The Core Idea)

A set is a well-defined collection of distinct objects.

The "why" here is about clarity and precision — we need to know exactly what belongs and what does not.

Well-defined: For any object, we can say yes or no — no ambiguity.
Distinct: No duplicates — each object appears only once.

Why? Because if we couldn't decide membership, we couldn't do any logical operations. Sets are the building blocks of all mathematical structures.

2. The Key "Formula": Set-Builder Notation

The most common way to define a set is:

S = \{ x \mid P(x) \}

This reads: "S is the set of all objects $x$ such that property $P(x)$ is true."

Why does this work?

$x$ is a placeholder for any object.
$P(x)$ is a logical condition (a predicate) that is either true or false for each $x$ .
The vertical bar $\mid$ means "such that".

Example:

A = \{ n \mid n \in \mathbb{N}, n \text{ is even} \}

Here, $P(n)$ is " $n$ is a natural number and $n$ is even".

Only those $n$ that satisfy both conditions are included.

Why this form? It avoids listing infinitely many elements. It gives a rule — a decision procedure — for membership.

3. The Two Fundamental Properties (Axioms)

Every set definition relies on two intuitive truths:

(a) Extensionality — Two sets are equal if they have the same elements.

A = B \iff (\forall x)(x \in A \iff x \in B)

Why? A set is completely determined by its members. There is no other hidden property.

If you know what's inside, you know the set.

(b) Membership — The only relation is $\in$ (belongs to).

x \in S \quad \text{or} \quad x \notin S

Why? Because a set is just a container. The only question we can ask is: "Is this object inside?"

4. Why Can't We Just List Everything?

For small sets, listing works:

\{1, 2, 3\}

But for infinite sets (like all natural numbers), listing is impossible.

Set-builder notation solves this by giving a rule instead of a list.

Example:

\mathbb{N} = \{ n \mid n \text{ is a positive integer} \}

This is not a formula to memorise — it's a definition by property.

5. The "Empty Set" — Why It Exists

The empty set $\emptyset$ (or $\{\}$ ) is the set with no elements. …

Start your 14-day free trial to unlock the full solution →

List the integers satisfying $x^2 < 16$ and count them.

$x^2 < 16 \implies -4 < x < 4$ . The integers strictly between $-4$ and $4$ are $-3,-2,-1,0,1,2,3$ .

…

Start your 14-day free trial to unlock the full solution →

Q.If B={x:x∈Z and x2<16}B = \{x : x \in \mathbb{Z} \text{ and } x^2 < 16\}B={x:x∈Z and x2<16}, then n(B)n(B)n(B) is

🎓Unlock everything free for 14 days

Q.If $B = \{x : x \in \mathbb{Z} \text{ and } x^2 < 16\}$ , then $n(B)$ is

Unlock everything free for 14 days