Let \(S=\){\(n∈NIn^3+3n^2+5n+3\) is not divisible by \(3\)}.Then, which of the following statements is true about \(S\)
\(S=ϕ\)
\(|S|≥2\) and \(|S|\)\(\) is a multiple of \(5\)
\(|S|\) is infinite
\(S\) is non empty and \(|S|\) is a multiple of \(3\)
\(S\) is non empty and \(|S|\) is a multiple of \(3\).
Given that:
\(S=\){\(n∈NIn^3+3n^2+5n+3\) is not divisible by \(3\)}.
Here as \(n∈N\)
let us test:
take, \(n=1\)
\(⇒1^3+3.1^2+5.1+3=12\)
take \(n=2\)
\(⇒2^3+3.2^2+5.2+3=33\)
take, \(n=3\)
\(⇒3^3+3.3^2+5.3+3=72\)
All these above cases proves that S is divisible by \(3\)
Hence,\(S={n∈N : n^3+3n^2+5n+3}\) is divisible by \(3\)
So, S is non empty and \(|S|\)is a multiple of \(3\) (_Ans.)
Let $P(S)$ denote the power set of $S=\{1,2,3, \ldots , 10\}$. Define the relations $R_1$ and $R_2$ on $P(S)$ as $A_1 B$ if $\left(A \cap B^c\right) \cup\left(B \cap A^c\right)=\emptyset$ and $A_2 B$ if $A \cup B^c=B \cup A^c, \forall A, B \in P(S)$. Then :
Set is the collection of well defined objects. Sets are represented by capital letters, eg. A={}. Sets are composed of elements which could be numbers, letters, shapes, etc.
Example of set: Set of vowels A={a,e,i,o,u}
There are three basic notation or representation of sets are as follows:
Statement Form: The statement representation describes a statement to show what are the elements of a set.
Roster Form: The form in which elements are listed in set. Elements in the set is seperatrd by comma and enclosed within the curly braces.
A={a,e,i,o,u}
Set Builder Form: