Question:

Let \(S=\){\(n∈NIn^3+3n^2+5n+3\) is not divisible by \(3\)}.Then, which of the following statements is true about \(S\)

Updated On: Apr 8, 2025
  • \(S\) is non empty and \(|S|\) is a multiple of \(3\).

  • \(|S|≥2\) and \(|S|\)\(\) is a multiple of \(5\)

  • \(|S|\) is infinite

  • \(S\) is non empty and \(|S|\) is a multiple of \(3\)

  • \(S=ϕ\)

Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is

Approach Solution - 1

Given: Let \( S = \{ n \in \mathbb{N} \mid n^3 + 3n^2 + 5n + 3 \text{ is not divisible by 3} \} \).

We analyze the polynomial modulo 3: \[ f(n) = n^3 + 3n^2 + 5n + 3 \] \[ f(n) \equiv n^3 + 2n \mod 3 \]

Using Fermat's Little Theorem (\( n^3 \equiv n \mod 3 \)): \[ f(n) \equiv n + 2n \equiv 3n \equiv 0 \mod 3 \]

This shows: \[ f(n) \text{ is divisible by 3 for all } n \in \mathbb{N} \]

Therefore, the set \( S \) contains no natural numbers: \[ S = \emptyset \]

Was this answer helpful?
1
0
Hide Solution
collegedunia
Verified By Collegedunia

Approach Solution -2

Let \( P(n) = n^3 + 3n^2 + 5n + 3 \). We want to find the values of \( n \in \mathbb{N} \) such that \( P(n) \) is not divisible by 3.

We can rewrite \( P(n) \) as:

\[ P(n) = n^3 + 3n^2 + 5n + 3 = n^3 + 2n + 3 \pmod{3} \]

since \( 3n^2 \) and 3 are divisible by 3.

Now we analyze the values of \( n^3 + 2n \pmod{3} \) for \( n = 0, 1, 2 \):

  • If \( n \equiv 0 \pmod{3} \), then \( n^3 + 2n \equiv 0 \pmod{3} \).
  • If \( n \equiv 1 \pmod{3} \), then \( n^3 + 2n \equiv 1 + 2 \equiv 3 \equiv 0 \pmod{3} \).
  • If \( n \equiv 2 \pmod{3} \), then \( n^3 + 2n \equiv 8 + 4 \equiv 12 \equiv 0 \pmod{3} \).

In all cases, \( n^3 + 2n \equiv 0 \pmod{3} \). Therefore, \( P(n) \equiv 0 \pmod{3} \) for all integers \( n \).

This means that \( n^3 + 3n^2 + 5n + 3 \) is always divisible by 3 for any integer \( n \). Consequently, \( S = \emptyset \), since there are no natural numbers \( n \) for which \( P(n) \) is not divisible by 3.

Therefore, the correct statement is (E).

Was this answer helpful?
0
0

Concepts Used:

Sets

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}

Representation of Sets

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.

  • For example, Set A is the list of the first five odd numbers.

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.

  • For example represent the set of vowels in roster form.

A={a,e,i,o,u}

Set Builder Form: 

  1. The set builder representation has a certain rule or a statement that specifically describes the common feature of all the elements of a set.
  2. The set builder form uses a vertical bar in its representation, with a text describing the character of the elements of the set.
  3. For example, A = { k | k is an even number, k ≤ 20}. The statement says, all the elements of set A are even numbers that are less than or equal to 20.
  4. Sometimes a ":" is used in the place of the "|".